My Library

University LibraryCatalogue

Limit search to items available for borrowing or consultation
Look for full text

Search Discovery

Search Trove

Add record to RefWorks

Author Jensen, Tommy R.

Title Graph coloring problems / Tommy R. Jensen, Bjarne Toft.

Published New York : Wiley, [1995]


Location Call No. Status
 UniM Bund  511.56 JENS {Bund89 20200519}    AVAILABLE
Physical description xix, 295 pages : illustrations ; 24 cm.
Series Wiley-Interscience series in discrete mathematics and optimization.
Wiley-Interscience series in discrete mathematics and optimization.
Notes "A Wiley-Interscience publication."
Bibliography Includes bibliographical references and indexes.
Contents 1. Introduction to Graph Coloring -- 2. Planar Graphs -- 3. Graphs on Higher Surfaces -- 4. Degrees -- 5. Critical Graphs -- 6. The Conjectures of Hadwiger and Hajos -- 7. Sparse Graphs -- 8. Perfect Graphs -- 9. Geometric and Combinatorial Graphs -- 10. Algorithms -- 11. Constructions -- 12. Edge Colorings -- 13. Orientations and Flows -- 14. Chromatic Polynomials -- 15. Hypergraphs -- 16. Infinite Chromatic Graphs -- 17. Miscellaneous Problems.
Summary Over the past hundred years, graph coloring theory has yielded many mathematically and philosophically interesting and profound results. But the last word on the subject is far from having been written, and a great deal remains to be learned about this central area of discrete mathematics. Now, in this fascinating study, Danish mathematicians Tommy R. Jensen and Bjarne Toft explore the fertile frontiers of graph coloring theory.
A valuable resource for discrete mathematicians, graph theorists, operations researchers, and theoretical computer scientists, Graph Coloring Problems will act as a springboard for further study while, at the same time, helping researchers avoid time wasted in attempting to solve problems for which solutions already exist.
Other author Toft, Bjarne.
Subject Map-coloring problem.
ISBN 0471028657 (paperback: acid-free)