Abstract
In the preceding chapters we have discussed unrestricted edge colorings that, in a variety of ways, induce vertex colorings that are either vertex-distinguishing or neighbor-distinguishing. In this chapter, we turn our attention from unrestricted edge colorings to proper edge colorings that induce set-defined vertex colorings which are either vertex-distinguishing or neighbor-distinguishing.
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
Bazgan, C., Harkat-Benhamdine, A., Li, H., & Woźniak, M. (1999). On the vertex-distinguishing proper edge-colorings of graphs. Journal of Combinatorial Theory, Series B, 75, 288–301.
Burris, A. C., & Schelp, R. H. (1997). Vertex-distinguishing proper edge colorings. Journal for Graph Theory, 26, 73–82.
Chartrand, G., English, S., & Zhang, P., Binomial colorings of graphs. Preprint.
Petersen, J. (1891). Die Theorie der regulären Graphen. Acta Mathematica, 15, 193–220.
Tait, P. G. (1880). Remarks on the colouring of maps. Proceedings of the Royal Society of Edinburgh, 10, 501–503, 729.
Zhang, Z., Liu, L., & Wang, J. (2002). Adjacent strong edge coloring of graphs. Applied Mathematics Letters, 15, 623–626.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2015 Ping Zhang
About this chapter
Cite this chapter
Zhang, P. (2015). Strong Edge Colorings of Graphs. In: Color-Induced Graph Colorings. SpringerBriefs in Mathematics. Springer, Cham. https://doi.org/10.1007/978-3-319-20394-2_8
Download citation
DOI: https://doi.org/10.1007/978-3-319-20394-2_8
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-20393-5
Online ISBN: 978-3-319-20394-2
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)