Abstract
In Chap. 4, we discussed vertex-distinguishing edge colorings of graphs in which each induced vertex color is the set of colors of its incident edges. We saw that this often requires a large number of colors in comparison with sum-defined vertex colorings described earlier. There is also a related irregular edge coloring for which the induced vertex colors are multisets rather than sets, which is necessarily more restrictive.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Aigner, M., & Triesch, E. (1990). Irregular assignments and two problems á la Ringel. In R. Bodendiek & R. Henn (Eds.), Topics in combinatorics and graph theory (pp. 29–36). Heidelberg: Physica.
Aigner, M., Triesch, E., & Tuza, Z. (1992). Irregular assignments and vertex-distinguishing edge-colorings of graphs. In Combinatorics’ 90 (pp. 1–9). New York: Elsevier Science.
Burris, A. C. (1994). On graphs with irregular coloring number 2. Congressus Numerantium, 100, 129–140.
Burris, A. C. (1995). The irregular coloring number of a tree. Discrete Mathematics, 141, 279–283.
Chartrand, G., & Zhang, P. (2011). Discrete mathematics, Waveland Press, Long Grove, IL.
Chartrand, G., Lesniak, L., & Zhang, P. (2010). Graphs & digraphs (5th ed.). Boca Raton, FL: Chapman & Hall/CRC.
Chartrand, G., Escuadro, H., Okamoto, F., & Zhang, P. (2006). Detectable colorings of graphs. Utilitas Mathematica, 69, 13–32.
Escuadro, H. (2006). Detectable colorings of graphs. Ph.D. Dissertation, Western Michigan University.
Escuadro, H., & Zhang, P. (2005). On detectable colorings of graphs. Mathematica Bohemica, 130, 427–445.
Escuadro, H., & Zhang, P. (2008). Extremal problems on detectable colorings of trees. Discrete Mathematics, 308, 1951–1961.
Escuadro, H., Okamoto, F., & Zhang, P. (2006). On detectable factorizations of cubic graphs Journal of Combinatorial Mathematics and Combinatorial Computing, 56, 47–63.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2015 Ping Zhang
About this chapter
Cite this chapter
Zhang, P. (2015). Multiset-Defined Irregular Colorings. In: Color-Induced Graph Colorings. SpringerBriefs in Mathematics. Springer, Cham. https://doi.org/10.1007/978-3-319-20394-2_5
Download citation
DOI: https://doi.org/10.1007/978-3-319-20394-2_5
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)