Graph coloring problems

Graph coloring problems

by Jensen, Tommy R.

Type Book
Rate 0.0 /5

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 origina…

Read More ↓

Title Statements

  • Full title :Graph coloring problems / Tommy R. Jensen, Bjarne Toft.

Summary

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.

Read More ↓

Edition Statements

  • Publication Date:©1995

Publication Statements

  • Publisher(s):John Wiley & Sons, Inc
  • Place of Publication:New York, New York
  • Language:eng
  • Publication Date:©1995

Notes

6.7 Chromatic 4-Schemes.

"A Wiley-Interscience Publication."

The Physical Object

  • Description:1 online resource (324 p.).

Edition Identifiers

  • ISBN:1283331985, 9781283331982, 9786613331984, 6613331988, 1118032497, 9781118032497, 1118030745, 9781118030745
  • oclc:on1303424629
  • LC Classification:QA612.18
  • Dewey Decimal:511.5

Table of Contents

Graph Coloring Problems; Contents; Preface; 1 Introduction to Graph Coloring; 1.1 Basic Definitions; 1.2 Graphs on Surfaces; 1.3 Vertex Degrees and Colorings; 1.4 Criticality and Complexity; 16.14 Partition Problem of Galvin and Hajnal; 1.5 Sparse Graphs and Random Graphs; 1.6 Perfect Graphs; 1.7 Edge-Coloring; 1.8 Orientations and Integer Flows; 1.9 List Coloring; 1.10 Generalized Graph Coloring; 1.11 Final Remarks; Bibliography; 2 Planar Graphs; 2.1 Four-Color Theorem; 2.2 Cartesian Sequences; 2.3 Intersection Graphs of Planar Segments; 2.4 Ringerl's Earth-Moon Problem

2.5 Ore and Plummer's Cyclic Chromatic Number2.6 Vertex Partitionings w.r.t. Coloring Number; 2.7 Vertex Partitionings w.r.t. Maximum Degree; 2.8 The Three-Color Problem; 2.9 Steinberg's Three-Color Problem; 2.10 Grünbaum and Havel's Three-Color Problem; 2.11 Grötzsch and Sachs' Three-Color Problem; 2.12 Barnette's Conjecture; 2.13 List-Coloring Planar Graphs; 2.14 Kronk and Mitchem's Entire Chromatic Number; 2.15 Nine-Color Conjecture; 2.16 Uniquely Colorable Graphs; 2.17 Density of 4-Critical Planar Graphs; 2.18 Square of Planar Graphs; Bibliography; 3 Graphs on Higher Surfaces

3.1 Heawood's Empire Problem3.2 …

Read More ↓

Subjects

Writers

More from this Series

Rate & Review

0.0/5
(0 people Voted)

No reviews yet. Be the first to rate this work.

Files & Downloads

No downloadable files are registered for this work yet.