Planar graphs without triangles adjacent to cycles of length from 3 to 9 are 3-colorable (Q2371269): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claims |
||
| Property / author | |||
| Property / author: Alekseĭ Nikolaevich Glebov / rank | |||
| Property / author | |||
| Property / author: Andre Raspaud / rank | |||
Revision as of 06:59, 22 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Planar graphs without triangles adjacent to cycles of length from 3 to 9 are 3-colorable |
scientific article |
Statements
Planar graphs without triangles adjacent to cycles of length from 3 to 9 are 3-colorable (English)
0 references
2 July 2007
0 references
color-4-critical graph
0 references
Euler's formula
0 references
plane graph without triangles
0 references
