Cover Image

Graph coloring problems /

Show other versions (1)
Bibliographic Details
Main Author: Jensen, Tommy R.
Other Authors: Toft, Bjarne
Format: eBook
Language:English
Published: New York : Wiley, ©1995.
Subjects:
Graph coloring.
Electronic books.
Online Access:Connect to the full text of this electronic book
Table of Contents:
  • 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.