Strong Edge Colorings of Graphs
- 555 Downloads
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.
KeywordsStrong Edge Coloring Vertex Coloring Strong Chromatic Index Binomial Graph Minimal Positive Integer
- 21.Chartrand, G., English, S., & Zhang, P., Binomial colorings of graphs. Preprint.Google Scholar