In the mathematical field of graph theory, the Grötzsch graph is a triangle-free graph with 11 vertices, 20 edges, chromatic number 4, and crossing number 5. It is named after the German mathematician Herbert Grötzsch, who used it as an example in connection with his 1959 theorem that planar triangle-free graphs are three-colorable. This description is adapted from Wikipedia contributors under CC BY-SA 4.0; changes were made. https://creativecommons.org/licenses/by-sa/4.0/
Facts
Origin Yearused by Grotzsch in connection with his 1959 theorem Connections
Attributed To
Source Grötzsch Graph (Wikipedia)
In Branch
Source Grötzsch Graph (Wikipedia)
Is Kind Of Object
Principal Result Of
Source Herbert Grötzsch (Wikipedia)
Sources
1. Grötzsch Graph (Wikipedia)
Lead section
In the mathematical field of graph theory, the Grötzsch graph is a triangle-free graph with 11 vertices, 20 edges, chromatic number 4, and crossing number 5.
Attributed To: Herbert Grötzsch, Lead sentence
It is named after German mathematician Herbert Grötzsch, who used it as an example in connection with his 1959 theorem that planar triangle-free graphs are 3-colorable.
- In Branch: Graph Theory, Lead sentence
View the SourceHerbert Grötzsch (Wikipedia)
Principal Result Of: Herbert Grötzsch, Lead, principal objectQuote, Principal Result Of: Herbert Grötzsch, Lead, principal object
the Grötzsch graph, a triangle-free graph that requires four colors in any graph coloring
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.