The color space of a graph

DOI10.1002/1097-0118(200007)34:3%3C234::AID-JGT4%3E3.0.CO;2-GzbMATH Open0957.05036OpenAlexW4233200035WikidataQ56926763 ScholiaQ56926763MaRDI QIDQ4500710FDOQ4500710

Authors: Carsten Thomassen, T. R. Jensen 

Publication date: 15 March 2001

Full work available at URL: https://doi.org/10.1002/1097-0118(200007)34:3%3C234::aid-jgt4%3E3.0.co;2-g

Recommendations

• Item:QQ2946045
• scientific article; zbMATH DE number 1882353
• Planar graphs without cycles of length from 4 to 7 are 3-colorable
• Planar graphs without triangles adjacent to cycles of length from 3 to 9 are 3-colorable

zbMATH Keywords

Cayley graphWagner graph3-colorable graphcolor matrix

Mathematics Subject Classification ID

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

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

Cited In (13)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4500710)