Planar graphs without triangles adjacent to cycles of length from 4 to 7 are 3-colorable (Q709301): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claims |
||
| Property / author | |||
| Property / author: Oleg V. Borodin / rank | |||
| Property / author | |||
| Property / author: Alekseĭ Nikolaevich Glebov / rank | |||
| Property / author | |||
| Property / author: Andre Raspaud / rank | |||
Revision as of 17:45, 15 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Planar graphs without triangles adjacent to cycles of length from 4 to 7 are 3-colorable |
scientific article |
Statements
Planar graphs without triangles adjacent to cycles of length from 4 to 7 are 3-colorable (English)
0 references
18 October 2010
0 references
graph
0 references
planar graph
0 references
3-coloring
0 references
