Graph Coloring Problems

ISBN-13: 9780471028659 / Angielski / Miękka / 1995 / 320 str.

Tommy R. Jensen; Bjarne Toft

Opis

The field of graph colouring is an area of discrete mathematics which gives operation research scientists the ability to classify components of a set within given constraints which are generated as a graph. By identifying more than 200 unsolved problems, this text shows a central aspect of discrete mathematics in a new perspective and creates challenges for its readers. Information is also provided on related results and the reference literature.

Spis treści

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.