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 copyright Book News, Inc. Portland, Or.
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.
