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...

Celý popis

Podrobná bibliografia

Vydané v:	Archives of control sciences Ročník 34; číslo No 1; s. 211 - 223
Hlavní autori:	Furmańczyk, Hanna, Kubale, Marek
Médium:	Journal Article
Jazyk:	English Polish
Vydavateľské údaje:	Polish Academy of Sciences 29.03.2024
Predmet:	1-absolute approximation algorithm corona graph corona products cubic graph equitable chromatic number polynomial algorithm
ISSN:	1230-2384
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!