Equitable colorings of l-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...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Archives of control sciences Ročník 34; číslo 1; s. 211
Hlavní autori: Furmańczyk, Hanna, Kubale, Marek
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Warsaw De Gruyter Brill Sp. z o.o., Paradigm Publishing Services 01.01.2024
Predmet:
Algorithms
Apexes
Approximation
Coloring
Graph coloring
Graph theory
Graphs
Polynomials
ISSN:1230-2384, 2300-2611
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí: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 x=( G). In this paper the problem of determining the value of equitable chromatic number for multicoronas of cubic graphs G◦ lH is studied. The problem of ordinary coloring of multicoronas of cubic graphs is solvable in polynomial time. The complexity of equitable coloring problem is an open question for these graphs. We provide some polynomially solvable cases of cubical multicoronas and give simple linear time algorithms for equitable coloring of such graphs which use at most x=( G◦ lH) + 1 colors in the remaining cases.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1230-2384
2300-2611
DOI:10.24425/acs.2024.149658