Skip to search formSkip to main contentSkip to account menu

Grötzsch's theorem

Known as: Grotzsch's theorem 
In the mathematical field of graph theory, Grötzsch's theorem is the statement that every triangle-free planar graph can be colored with only three… 
Wikipedia (opens in a new tab)

Related topics

Related topics

11 relations
Four color theoremGirth (graph theory)Graph homomorphismGraph theory

Broader (1)

Graph coloring

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2009
2009
Homomorphisms of triangle-free graphs without a K5-minor
2007
2007
A Unified Spiral Chain Coloring Algorithm for Planar Graphs
In this paper we have given a unified graph coloring algorithm for planar graphs. The problems that have been considered in this… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)