Skip to main content

Multiset-Defined Irregular Colorings

  • Chapter
Color-Induced Graph Colorings

Part of the book series: SpringerBriefs in Mathematics ((BRIEFSMATH))

  • 719 Accesses

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. 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.

    Chapter  Google Scholar 

  2. 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.

    Google Scholar 

  3. Burris, A. C. (1994). On graphs with irregular coloring number 2. Congressus Numerantium, 100, 129–140.

    MathSciNet  MATH  Google Scholar 

  4. Burris, A. C. (1995). The irregular coloring number of a tree. Discrete Mathematics, 141, 279–283.

    Article  MathSciNet  MATH  Google Scholar 

  5. Chartrand, G., & Zhang, P. (2011). Discrete mathematics, Waveland Press, Long Grove, IL.

    Google Scholar 

  6. Chartrand, G., Lesniak, L., & Zhang, P. (2010). Graphs & digraphs (5th ed.). Boca Raton, FL: Chapman & Hall/CRC.

    Google Scholar 

  7. Chartrand, G., Escuadro, H., Okamoto, F., & Zhang, P. (2006). Detectable colorings of graphs. Utilitas Mathematica, 69, 13–32.

    MathSciNet  MATH  Google Scholar 

  8. Escuadro, H. (2006). Detectable colorings of graphs. Ph.D. Dissertation, Western Michigan University.

    MATH  Google Scholar 

  9. Escuadro, H., & Zhang, P. (2005). On detectable colorings of graphs. Mathematica Bohemica, 130, 427–445.

    MathSciNet  MATH  Google Scholar 

  10. Escuadro, H., & Zhang, P. (2008). Extremal problems on detectable colorings of trees. Discrete Mathematics, 308, 1951–1961.

    Article  MathSciNet  MATH  Google Scholar 

  11. Escuadro, H., Okamoto, F., & Zhang, P. (2006). On detectable factorizations of cubic graphs Journal of Combinatorial Mathematics and Combinatorial Computing, 56, 47–63.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints 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

Publish with us

Policies and ethics