http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-2.xsd
1 online resource (xix, 295 pages) : illustrations
Front Matter -- Introduction to Graph Coloring -- Planar Graphs -- Graphs on Higher Surfaces -- Degrees -- Critical Graphs -- The Conjectures of Hadwiger and Haj̤s -- Sparse Graphs -- Perfect Graphs -- Geometric and Combinatorial Graphs -- Algorithms -- Constructions -- Edge Colorings -- Orientations and Flows -- Chromatic Polynomials -- Hypergraphs -- Infinite Chromatic Graphs -- Miscellaneous Problems -- Author Index -- Subject Index -- Wiley-Interscience Series in Discrete Mathematics and Optimization.
Graphs on Surfaces -- Vertex Degrees and Colorings -- Criticality and Complexity -- Sparse Graphs and Random Graphs -- Perfect Graphs -- Edge-Coloring -- Orientations and Integer Flows -- List Coloring -- Generalized Graph Coloring -- Planar Graphs -- Four-Color Theorem -- Cartesian Sequences -- Intersection Graphs of Planar Segments -- Ringel's Earth-Moon Problem -- Ore and Plummer's Cyclic Chromatic Number -- Vertex Partitionings w.r.t. Coloring Number -- Vertex Partitionings w.r.t. Maximum Degree -- The Three-Color Problem -- Steinberg's Three-Color Problem -- Grunbaum and Havel's Three-Color Problem -- Grotzsch and Sachs' Three-Color Problem -- Barnette's Conjecture -- List-Coloring Planar Graphs -- Kronk and Mitchem's Entire Chromatic Number -- Nine-Color Conjecture -- Uniquely Colorable Graphs -- Density of 4-Critical Planar Graphs -- Square of Planar Graphs -- Graphs on Higher Surfaces -- Heawood's Empire Problem -- Grunbaum's 3-Edge-Color Conjecture -- Albertson's Four-Color Problem -- Improper Colorings -- Number of 6-Critical Graphs on a Surface -- Toroidal Polyhedra -- Polynomial Coloring of Embedded Graphs -- Sparse Embedded Graphs -- Ringel's 1-Chromatic Number -- Borodin's Conjecture on Diagonal Coloring -- Acyclic Colorings -- Cochromatic Numbers -- Graphs on Pseudo-Surfaces -- Degrees -- The Coloring Number -- Coloring of Decomposable Graphs -- Color-Bound Families of Graphs -- Edge-Disjoint Placements -- Powers of Hamilton Cycles -- Brooks' Theorem for Triangle-Free Graphs.
Electronic reproduction. [Place of publication not identified] : HathiTrust Digital Library, 2010. MiAaHDL
Master and use copy. Digital master created according to Benchmark for Faithful Digital Reproductions of Monographs and Serials, Version 1. Digital Library Federation, December 2002. http://purl.oclc.org/DLF/benchrepro0212 MiAaHDL
digitized 2010 HathiTrust Digital Library committed to preserve pda MiAaHDL
Includes bibliographical references and indexes.