Equitable colorings of -corona products of cubic graphs

A graph G is equitably k-colorable if its vertices can be partitioned into k independent sets in such a way that the number of vertices in any two sets differ by at most one. The smallest integer k for which such a coloring exists is known as the equitable chromatic number of G and it is denoted by...

Full description

Saved in:

Bibliographic Details
Published in:	Archives of control sciences Vol. 34; no. No 1; pp. 211 - 223
Main Authors:	Furmańczyk, Hanna, Kubale, Marek
Format:	Journal Article
Language:	English Polish
Published:	Polish Academy of Sciences 29.03.2024
Subjects:	1-absolute approximation algorithm corona graph corona products cubic graph equitable chromatic number polynomial algorithm
ISSN:	1230-2384
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!