
Graph Coloring Problems
Wiley (Publisher)
1st Edition
Published on 29. March 1995
Book
Paperback/Softback
320 pages
978-0-471-02865-9 (ISBN)
Description
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.
More details
Series
Language
English
Place of publication
United States
Publishing group
John Wiley & Sons Inc
Target group
College/higher education
Professional and scholarly
Product notice
Paperback (trade)
Unsewn / adhesive bound
Dimensions
Height: 229 mm
Width: 152 mm
Thickness: 19 mm
Weight
528 gr
ISBN-13
978-0-471-02865-9 (9780471028659)
Copyright in bibliographic data and cover images is held by Nielsen Book Services Limited or by the publishers or by their respective licensors: all rights reserved.
Schweitzer Classification
Other editions
Additional editions

Tommy R. Jensen | Bjarne Toft
Graph Coloring Problems
E-Book
10/2011
Wiley
€170.99
Available for download
Persons
Tommy R. Jensen and Bjarne Toft are the authors of Graph Coloring Problems, published by Wiley.
Author
University of Southern Denmark, Odense, Denmark
University of Southern Denmark, Odense, Denmark
Content
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.