Abstract
In [76], a number of edge colorings were described that gave rise to various vertex colorings of interest. In one instance, the color of a vertex was defined as the set of colors of the edges incident with the vertex, with the goal to minimize the number of colors so that the resulting coloring is vertex-distinguishing. In this chapter, we consider edge colorings that result in the same vertex coloring, but with a different goal in mind. Here, for a fixed number k of edge colors 1, 2, …, k, we wish to determine graphs of minimum order having the property that for every subset S of [k] = { 1, 2, …, k}, there is a vertex whose color is S.
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
Aigner, M., Triesch, E., Tuza, Z.: Irregular assignments and vertex-distinguishing edge-colorings of graphs. In: Combinatorics’ 90, pp. 1–9. Elsevier Science, New York (1992)
Bazgan, C., Harkat-Benhamdine, A., Li, H., Woźniak, M.: On the vertex-distinguishing proper edge-colorings of graphs. J. Combin. Theory Ser. B. 75, 288–301 (1999)
Bazgan, C., Harkat-Benhamdine, A., Li, H., Woźniak, M.: A note on the vertex-distinguishing proper coloring of graphs with large minimum degree. Graph theory (Kazimierz Dolny, 1997). Discrete Math. 236, 37–42 (2001)
Burris, A.C., Schelp, R.H.: Vertex-distinguishing proper edge colorings. J. Graph Theory 26, 73–82 (1997)
Černý, J., Horňák, M., Soták, R.: Observability of a graph. Math. Slovaca 46, 21–31 (1996)
Chartrand, G., Zhang, P.: Chromatic Graph Theory. Chapman & Hall/CRC Press, Boca Raton (2009)
Chartrand, G., English, S., Zhang, P.: Binomial colorings of graphs. Bull. Inst. Combin. Appl. (to appear)
Favaron, O., Li, H., Schelp, R.H.: Strong edge colorings of graphs. Discrete Math. 159, 103–109 (1996)
Horňák, M., Soták, R.: Observability of complete multipartite graphs with equipotent parts. Ars Combin. 41, 289–301 (1995)
Horňák, M., Soták, R.: Asymptotic behaviour of the observability of Q n . Discrete Math. 176, 139–148 (1997)
Petersen, J.: Die Theorie der regulären Graphen. Acta Math. 15, 193–220 (1891)
Zhang, P.: Color-Induced Graph Colorings. Springer, New York (2015)
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2016 The Author
About this chapter
Cite this chapter
Zhang, P. (2016). Binomial Edge Colorings. In: A Kaleidoscopic View of Graph Colorings. SpringerBriefs in Mathematics. Springer, Cham. https://doi.org/10.1007/978-3-319-30518-9_2
Download citation
DOI: https://doi.org/10.1007/978-3-319-30518-9_2
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)