期刊论文详细信息
Discussiones Mathematicae Graph Theory | |
Equitable Colorings Of Corona Multiproducts Of Graphs | |
Kubale Marek1  Mkrtchyan Vahan V.2  Furmánczyk Hanna3  | |
[1] Department of Algorithms and System Modelling Gdánsk University of Technology Narutowicza 11/12, 80-233 Gdánsk, Poland;Department of Informatics and Applied Mathematics Yerevan State University, Yerevan, Armenia;Institute of Informatics, University of Gdánsk Wita Stwosza 57, 80-952 Gdánsk, Poland; | |
关键词: corona graph; equitable chromatic number; equitable coloring conjecture; equitable graph coloring; multiproduct of graphs; np-completeness; polynomial algorithm.; | |
DOI : 10.7151/dmgt.1992 | |
来源: DOAJ |
【 摘 要 】
A graph is equitably k-colorable if its vertices can be partitioned into k independent sets in such a way that the numbers of vertices in any two sets differ by at most one. The smallest k for which such a coloring exists is known as the equitable chromatic number of G and denoted by
【 授权许可】
Unknown