Abstract
We give some results regarding the equitable chromatic number for l-corona product of two graphs: G and H, where G is an equitably 3- or 4-colorable graph and H is an r-partite graph, a cycle or a complete graph. Our proofs lead to polynomial algorithms for equitable coloring of such graph products provided that there is given an equitable coloring of G.
Citations
-
1
CrossRef
-
0
Web of Science
-
3
Scopus
Authors (3)
Cite as
Full text
download paper
downloaded 41 times
- Publication version
- Accepted or Published Version
- DOI:
- Digital Object Identifier (open in new tab) 10.7151/dmgt.1992
- License
- open in new tab
Keywords
Details
- Category:
- Articles
- Type:
- artykuł w czasopiśmie wyróżnionym w JCR
- Published in:
-
Discussiones Mathematicae Graph Theory
no. 37,
pages 1079 - 1094,
ISSN: 1234-3099 - Language:
- English
- Publication year:
- 2017
- Bibliographic description:
- Furmańczyk H., Kubale M., Mkrtchyan V.: Equitable coloring of corona multiproducts of graphs// Discussiones Mathematicae Graph Theory. -Vol. 37, iss. 4 (2017), s.1079-1094
- DOI:
- Digital Object Identifier (open in new tab) 10.7151/dmgt.1992
- Verified by:
- Gdańsk University of Technology
seen 110 times
Recommended for you
Equitable coloring of corona products of graphs
- H. Furmańczyk,
- K. Kaliraj,
- M. Kubale
- + 1 authors
2013