Abstract
In Chap. 2 and 3, we described two edge colorings that give rise to two vertex colorings, one in terms of sets of colors and the other in terms of multisets. Now, in this chapter and the next, the situation is reversed, as we describe vertex colorings that give rise to edge colorings.
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
Bi, Z., Byers, A., English, S., Laforge, E., Zhang, P.: Graceful colorings of graphs. J. Combin. Math. Combin. Comput. (to appear)
Bi, Z., Byers, A., Zhang, P.: Revisiting graceful labelings of graphs. J. Combin. Math. Combin. Comput. (to appear)
Brooks, R.L.: On coloring the nodes of a network. Proc. Camb. Philol. Soc. 37, 194–197 (1941)
English, S., Zhang, P.: On graceful colorings of trees. Preprint
Gallian, J.A.: A dynamic survey of graph labeling. Electron. J. Combin. 17, #DS6 (2014)
Golomb, S.W.: How to number a graph. In: Graph Theory and Computing, pp. 23–37. Academic Press, New York (1972)
Rosa, A.: On certain valuations of the vertices of a graph. In: Theory of Graphs, pp. 349–355. Gordon and Breach, New York (1967)
Vizing, V.G.: On an estimate of the chromatic class of a p-graph (Russian). Diskret. Analiz. 3, 25–30 (1964)
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2016 The Author
About this chapter
Cite this chapter
Zhang, P. (2016). Graceful Vertex Colorings. In: A Kaleidoscopic View of Graph Colorings. SpringerBriefs in Mathematics. Springer, Cham. https://doi.org/10.1007/978-3-319-30518-9_4
Download citation
DOI: https://doi.org/10.1007/978-3-319-30518-9_4
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-30516-5
Online ISBN: 978-3-319-30518-9
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)