Abstract
In a proper k-coloring of a k-chromatic graph, for every two distinct colors there are always adjacent vertices with these colors. This observation has led to a coloring called a complete coloring, which is the primary topic of this chapter.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
G. Chartrand, F. Okamoto, Z. Tuza, P. Zhang, A note on graphs with prescribed complete coloring numbers. J. Comb. Math. Comb. Comput. 73, 77–84 (2010)
C.A. Christen, S.M. Selkow, Some perfect coloring properties of graphs. J. Comb. Theory Ser. B 27, 49–59 (1979)
P. Erdös, W.R. Hare, S.T. Hedetniemi, R. Laskar, On the equality of the Grundy and ochromatic numbers of graphs. J. Graph Theory 11, 157–159 (1987)
P.M. Grundy, Mathematics and games. Eureka 2, 6–8 (1939)
F. Harary, S.T. Hedetniemi, G. Prins, An interpolation theorem for graphical homomorphisms. Port. Math. 26, 453–462 (1967)
S.T. Hedetniemi, Homomorphisms of graphs and automata. Doctoral Dissertation, The University of Michigan, 1966
P. Hell, D.J. Miller, Graphs with given achromatic number. Discret. Math. 16, 195–207 (1976)
G.J. Simmons, The ordered chromatic number of planar maps. Congr. Numer. 36, 59–67 (1982)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2019 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this chapter
Cite this chapter
Chartrand, G., Haynes, T.W., Henning, M.A., Zhang, P. (2019). Complete Colorings. In: From Domination to Coloring. SpringerBriefs in Mathematics. Springer, Cham. https://doi.org/10.1007/978-3-030-31110-0_7
Download citation
DOI: https://doi.org/10.1007/978-3-030-31110-0_7
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-31109-4
Online ISBN: 978-3-030-31110-0
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)