Graph Coloring Problems. Wiley Series in Discrete Mathematics and Optimization

  • ID: 2175335
  • Book
  • 320 Pages
  • John Wiley and Sons Ltd
1 of 4
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.
Note: Product cover images may vary from those shown
2 of 4
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.
Note: Product cover images may vary from those shown
3 of 4

Loading
LOADING...

4 of 4
Tommy R. Jensen
Bjarne Toft
Note: Product cover images may vary from those shown
5 of 4
Note: Product cover images may vary from those shown
Adroll
adroll