Skip to main content
SpringerLink
Log in

Modular Colorings

  • Chapter
  • First Online:
A Kaleidoscopic View of Graph Colorings

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

  • 795 Accesses

Abstract

Historically, a number of problems and puzzles have been introduced that initially appeared to have no connection to graph colorings but, upon further analysis, suggested graph coloring problems. In this chapter, we discuss two combinatorial problems and two graph coloring problems inspired by these problems.

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

Access this chapter

Log in via an institution
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. Andrews, E., Lumduanhom, C., Zhang, P.: From combinatorial problems to graph colorings. J. Combin. Math. Combin. Comput. 90, 75–95 (2014)

    MathSciNet  MATH  Google Scholar 

  2. Chartrand, G., Phinezy, B., Zhang, P.: On closed modular colorings of regular graphs. Bull. Inst. Combin. Appl. 66, 7–32 (2012)

    MathSciNet  MATH  Google Scholar 

  3. Fujie-Okamoto, F., Will, T.G.: Efficient computation of the modular chromatic numbers of trees. J. Combin. Math. Combin. Comput. 82, 77–86 (2012)

    MathSciNet  MATH  Google Scholar 

  4. Okamoto, F., Salehi, E., Zhang, P.: On modular colorings of caterpillars Congr. Numer. 197, 213–220 (2009)

    MathSciNet  MATH  Google Scholar 

  5. Okamoto, F., Salehi, E., Zhang, P.: A checkerboard problem and modular colorings of graphs. Bull. Inst. Combin. Appl. 58, 29–47 (2010)

    MathSciNet  MATH  Google Scholar 

  6. Okamoto, F., Salehi, E., Zhang, P.: A solution to the checkerboard problem. Int. J. Comput. Appl. Math. 5, 447–458 (2010)

    MathSciNet  Google Scholar 

  7. Phinezy, B.: Variations on a graph coloring theme. Ph.D. Dissertation, Western Michigan University (2012)

    Google Scholar 

  8. Phinezy, B., Zhang, P.: From puzzles to graphs to colorings. Congr. Numer. 214, 103–119 (2012)

    MathSciNet  MATH  Google Scholar 

  9. Sutner, K.: Linear cellular automata and the Garden-of-Eden. Math. Intell. 11, 49–53 (1989)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Western Michigan University, Kalamazoo, MI, USA

    Ping Zhang

Authors
  1. Ping Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 2016 The Author

About this chapter

Cite this chapter

Zhang, P. (2016). Modular Colorings. In: A Kaleidoscopic View of Graph Colorings. SpringerBriefs in Mathematics. Springer, Cham. https://doi.org/10.1007/978-3-319-30518-9_11

Download citation

Publish with us

Policies and ethics

Search

Navigation