Grötzsch's theorem (Q6482266)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: [[]] |
every triangle-free planar graph is 3-colorable
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Grötzsch's theorem |
every triangle-free planar graph is 3-colorable |
Statements
Identifiers
74488901
0 references
/m/09gg480
0 references
