A Kaleidoscopic View of Graph Colorings, 1st ed. 2016 SpringerBriefs in Mathematics Series
Auteur : Zhang Ping
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.
Assembles the latest research on chromatic graph theory, vertex colorings, edge colorings, binomial colorings, kaleidoscopic colorings and majestic colorings
Contains detailed proofs and illustrations
Provides a number of new problems and topics to study?
Date de parution : 04-2016
Ouvrage de 157 p.
15.5x23.5 cm
Disponible chez l'éditeur (délai d'approvisionnement : 15 jours).
Prix indicatif 52,74 €
Ajouter au panierThème d’A Kaleidoscopic View of Graph Colorings :
Mots-clés :
chromatic graph theory; chromatic index; chromatic number; edge coloring; graph theory; vertex coloring; Kaleidoscopic View; Graph Colorings; Four Color Problem; binomial colorings; kaleidoscopic colorings; majestic colorings; region colorings of planar graphs; Complete Kaleidoscopes; Eulerian Graphs and Digraphs; Strong Edge Colorings; Graceful Labelings; Harmonious Colorings; Harmonious Labelings; Banquet Seating Problem
