Graph Coloring Problems
Wiley-Interscience Series in Discrete Mathematics and Optimization
1. Auflage März 1995
320 Seiten, Softcover
Wiley & Sons Ltd
ISBN:
978-0-471-02865-9
John Wiley & Sons
Contains a wealth of information previously scattered in research journals, conference proceedings and technical reports. Identifies more than 200 unsolved problems. Every problem is stated in a self-contained, extremely accessible format, followed by comments on its history, related results and literature. The book will stimulate research and help avoid efforts on solving already settled problems. Each chapter concludes with a comprehensive list of references which will lead readers to original sources, important contributions and other surveys.
Planar Graphs.
Graphs on Higher Surfaces.
Degrees.
Critical Graphs.
The Conjectures of Hadwiger and Hajos.
Sparse Graphs.
Perfect Graphs.
Geometric and Combinatorial Graphs.
Algorithms.
Constructions.
Edge Colorings.
Orientations and Flows.
Chromatic Polynomials.
Hypergraphs.
Infinite Chromatic Graphs.
Miscellaneous Problems.
Indexes.
Graphs on Higher Surfaces.
Degrees.
Critical Graphs.
The Conjectures of Hadwiger and Hajos.
Sparse Graphs.
Perfect Graphs.
Geometric and Combinatorial Graphs.
Algorithms.
Constructions.
Edge Colorings.
Orientations and Flows.
Chromatic Polynomials.
Hypergraphs.
Infinite Chromatic Graphs.
Miscellaneous Problems.
Indexes.
Tommy R. Jensen and Bjarne Toft are the authors of Graph Coloring Problems, published by Wiley.
