A Kaleidoscopic View of Graph Colorings

ISBN-13: 9783319305165 / Angielski / Miękka / 2016 / 157 str.

Ping Zhang

Opis

This book describes kaleidoscopic topics that have developed in the area of graph colorings. Unifying current material on graph coloring, this book describes current information on vertex and edge colorings in graph theory, including harmonious colorings, majestic colorings, kaleidoscopic colorings and binomial colorings. Recently there have been a number of breakthroughs in vertex colorings that give rise to other colorings in a graph, such as graceful labelings of graphs that have been reconsidered under the language of colorings. The topics presented in this book include sample detailed proofs and illustrations, which depicts elements that are often overlooked. This book is ideal for graduate students and researchers in graph theory, as it covers a broad range of topics and makes connections between recent developments and well-known areas in graph theory.

Recenzje

"This book has the unique goal of covering the non-typical types of colorings in hopes of leading to new research and, in effect, providing a useful text with problems approachable for undergraduate students and up. ... The author provides many short proofs that illustrate the different types of proof techniques used to solve these types of graph theory problems. Additionally, the author has included many open questions to show some direction in which to take one's research." (John Asplund, Mathematical Reviews, November, 2016)

Spis treści

1. Introduction.- 2. Binomial Edge Colorings.- 3. Kaleidoscopic Edge Colorings.- 4. Graceful Vertex Colorings.- 5.Harmonious Vertex Colorings.- 6. A Map Coloring Problem.- 7. Set Colorings.- 8. Multiset Colorings.- 9. Metric Colorings.- 10. Sigma Colorings.- 11. Modular Colorings.- 12. A Banquet Seating Problem.- 13. Irregular Colorings.- 14. Recognizable Colorings.- References.- Index.