Search
Abstract
In this paper we consider an equitable coloring of some corona products of graphs G and H in symbols, G o H). In particular, we show that deciding the colorability of G o H is NP-complete even if G is 4-regular and H is K_2. Next, we prove exact values or upper bounds on the equitable chromatic number of G o H, where G is an equitably 3- or 4-colorable graph and H is an r-partite graph, a path, a cycle or a complete graph.
Authors (4)
-
Hanna Furmańczyk
- Uniwersytet Gdański Instytut Informatyki
-
K. Kaliraj
- .. ..
-
J. Vernold Vivin
- .. ..
Cite as
Full text
full text is not available in portal
Keywords
Details
- Category:
- Articles
- Type:
- artykuły w czasopismach recenzowanych i innych wydawnictwach ciągłych
- Published in:
-
Advances and Applications in Discrete Mathematics
no. 11,
pages 103 - 120,
ISSN: 0974-1658 - Language:
- English
- Publication year:
- 2013
- Bibliographic description:
- Furmańczyk H., Kaliraj K., Kubale M., Vernold Vivin J.: Equitable coloring of corona products of graphs// Advances and Applications in Discrete Mathematics. -Vol. 11., nr. 2 (2013), s.103-120
- Verified by:
- Gdańsk University of Technology
seen 117 times