Color-Induced Graph Colorings

  • Ping┬áZhang

Part of the SpringerBriefs in Mathematics book series (BRIEFSMATH)

Table of contents

  1. Front Matter
    Pages i-xiv
  2. Ping Zhang
    Pages 1-4
  3. Ping Zhang
    Pages 5-29
  4. Ping Zhang
    Pages 43-50
  5. Ping Zhang
    Pages 51-60
  6. Ping Zhang
    Pages 81-94
  7. Ping Zhang
    Pages 95-111
  8. Back Matter
    Pages 113-118

About this book


A comprehensive treatment of color-induced graph colorings is presented in this book, emphasizing vertex colorings induced by edge colorings. The coloring concepts described in this book depend not only on the property required of the initial edge coloring and the kind of objects serving as colors, but also on the property demanded of the vertex coloring produced. For each edge coloring introduced, background for the concept is provided, followed by a presentation of results and open questions dealing with this topic. While the edge colorings discussed can be either proper or unrestricted, the resulting vertex colorings are either proper colorings or rainbow colorings. This gives rise to a discussion of irregular colorings, strong colorings, modular colorings, edge-graceful colorings, twin edge colorings and binomial colorings. Since many of the concepts described in this book are relatively recent, the audience for this book is primarily mathematicians interested in learning some new areas of graph colorings as well as researchers and graduate students in the mathematics community, especially the graph theory community.


Graph colorings Monochromatic Vertex Colorings Proper Vertex Colorings Rainbow Vertex Colorings colored-induced neighbor-distinguishing

Authors and affiliations

  • Ping┬áZhang
    • 1
  1. 1.Department of MathematicsWestern Michigan UniversityKalamazooUSA

Bibliographic information