Abstract
In this paper we introduce the notion of a coloring restriction, a generalization of the motion of a relative coloring. To each vertex of a subgraph of a graph G, a set of admissible colorings is assigned. The problem is to characterize those coloring restrictions which admit a consistent coloring with a specified number of colors.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
F. Harary, Graph Theory, Addison-Wesley, Reading, Mass., 1969.
P. C. Kainen, Relative colorings of graphs, J. Combinatorial Theory, 6 (1969), 259–262.
R. B. Levow, Coloring planar graphs with five or more colors, Proc. 6th S-E. Conf. Combinatorics, Graph Theory and Computing, Boca Raton, 1974, 549–561.
W. Meyer, Five coloring planar maps, J. Combinatorial Theory 13 (1972), 72–82.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1978 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Levow, R.B. (1978). Coloring restrictions. In: Alavi, Y., Lick, D.R. (eds) Theory and Applications of Graphs. Lecture Notes in Mathematics, vol 642. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0070391
Download citation
DOI: https://doi.org/10.1007/BFb0070391
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-08666-6
Online ISBN: 978-3-540-35912-8
eBook Packages: Springer Book Archive