Graph colouring and variations /

Graph Colouring and Variations.

Détails bibliographiques
Cote:Libro Electrónico
Autres auteurs: Werra, D. de, Hertz, A.
Format: Électronique eBook
Langue:Inglés
Publié: Amsterdam ; New York : New York, N.Y., U.S.A. : North-Holland ; Sole distributors for the U.S.A. and Canada, Elsevier Science Pub. Co., 1989.
Collection:Annals of discrete mathematics ; 39.
Sujets:
Graph coloring.
Map-coloring problem.
Probl�eme du coloriage des cartes.
Coloriage de graphes.
MATHEMATICS > Topology.
Cartes > Coloriage.
Graphs > Edges > Colouring
Accès en ligne:Texto completo
Texto completo
Texto completo
Table des matières:
  • Front Cover; Graph Colouring and Variations; Copyright Page; Contents; Foreword; Chapter 1. Minimax relations for the partial q-colorings of a graph; Chapter 2. A min-max relation for the partial q-colourings of a graph. Part II: Box perfection; Chapter 3. On locally-perfect colorings; Chapter 4. The subchromatic number of a graph; Chapter 5. Connected sequential colorings; Chapter 6. Two conjectures on edge-colouring; Chapter 7. A new upper bound for the list chromatic number; Chapter 8. A note on perfect orders; Chapter 9. On the Penrose number of cubic diagrams.

Documents similaires