The color space of a graph

DOI<234::AID-JGT4>3.0.CO;2-G 10.1002/1097-0118(200007)34:3<234::AID-JGT4>3.0.CO;2-GzbMath0957.05036OpenAlexW4233200035WikidataQ56926763 ScholiaQ56926763MaRDI QIDQ4500710

Carsten Thomassen, Tommy R. Jensen

Publication date: 15 March 2001

Full work available at URL: https://doi.org/10.1002/1097-0118(200007)34:3<234::aid-jgt4>3.0.co;2-g

zbMATH Keywords

Cayley graphWagner graph3-colorable graphcolor matrix

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Coloring of graphs and hypergraphs (05C15)

Related Items (max. 100)

Further extensions of the Grötzsch theorem ⋮ Do triangle-free planar graphs have exponentially many 3-colorings? ⋮ Many 3-colorings of triangle-free planar graphs ⋮ 3-Coloring Triangle-Free Planar Graphs with a Precolored 9-Cycle ⋮ A step towards the strong version of Havel's three color conjecture ⋮ Short proofs of coloring theorems on planar graphs ⋮ Graphs with full rank 3-color matrix and few 3-colorings ⋮ What is on his mind? ⋮ Planar graphs without triangles adjacent to cycles of length from 4 to 7 are 3-colorable ⋮ Planar graphs with neither 5-cycles nor close 3-cycles are 3-colorable ⋮ Adynamic coloring of graphs ⋮ Exponentially many 3-colorings of planar triangle-free graphs with no short separating cycles

Cites Work

• Five-coloring maps on surfaces
• Five-coloring graphs on the torus
• Grötzsch's 3-color theorem and its counterparts for the torus and the projective plane
• On uniquely colorable planar graphs

This page was built for publication: The color space of a graph