Advertisement

Strong Edge Colorings of Graphs

  • Ping Zhang
Chapter
  • 555 Downloads
Part of the SpringerBriefs in Mathematics book series (BRIEFSMATH)

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.

Keywords

Strong Edge Coloring Vertex Coloring Strong Chromatic Index Binomial Graph Minimal Positive Integer 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. 12.
    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.MathSciNetCrossRefzbMATHGoogle Scholar
  2. 18.
    Burris, A. C., & Schelp, R. H. (1997). Vertex-distinguishing proper edge colorings. Journal for Graph Theory, 26, 73–82.MathSciNetCrossRefzbMATHGoogle Scholar
  3. 21.
    Chartrand, G., English, S., & Zhang, P., Binomial colorings of graphs. Preprint.Google Scholar
  4. 72.
    Petersen, J. (1891). Die Theorie der regulären Graphen. Acta Mathematica, 15, 193–220.MathSciNetCrossRefzbMATHGoogle Scholar
  5. 76.
    Tait, P. G. (1880). Remarks on the colouring of maps. Proceedings of the Royal Society of Edinburgh, 10, 501–503, 729.zbMATHGoogle Scholar
  6. 81.
    Zhang, Z., Liu, L., & Wang, J. (2002). Adjacent strong edge coloring of graphs. Applied Mathematics Letters, 15, 623–626.MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Ping Zhang 2015

Authors and Affiliations

  • Ping Zhang
    • 1
  1. 1.Department of MathematicsWestern Michigan UniversityKalamazooUSA

Personalised recommendations