Graph Coloring Problems

by Tommy R. Jensen, Bjarne Toft

Overview

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.

Product Details

ISBN-13:	9780471028659
Publisher:	Wiley
Publication date:	01/18/1995
Series:	Wiley Series in Discrete Mathematics and Optimization , #39
Pages:	320
Product dimensions:	5.94(w) x 9.13(h) x 0.79(d)

About the Author

Tommy R. Jensen and Bjarne Toft are the authors of Graph Coloring Problems, published by Wiley.

Table of Contents

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.

Editorial Reviews

A study of graph coloring theory and discrete mathematics. Explains important definitions and known theorems, identifies some 200 unsolved problems in graph coloring theory, and discusses the history and related results of each problem. Includes a bibliography at the end of each section. Of interest to discrete mathematicians, graph theorists, operations researchers, and theoretical computer scientists. Annotation c. Book News, Inc., Portland, OR (booknews.com)

Booknews