Planar graphs without adjacent cycles of length at most seven are 3-colorable (Q1045158)
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: Planar graphs without adjacent cycles of length at most seven are 3-colorable |
scientific article; zbMATH DE number 5648183
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Planar graphs without adjacent cycles of length at most seven are 3-colorable |
scientific article; zbMATH DE number 5648183 |
Statements
Planar graphs without adjacent cycles of length at most seven are 3-colorable (English)
0 references
15 December 2009
0 references
the 3-color problem
0 references
0 references
0 references
