Planar graphs without adjacent cycles of length at most seven are 3-colorable (Q1045158): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 23:56, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Planar graphs without adjacent cycles of length at most seven are 3-colorable |
scientific article |
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
