Planar graphs without triangles adjacent to cycles of length from 3 to 9 are 3-colorable (Q2371269): Difference between revisions
From MaRDI portal
Created a new Item |
Set profile property. |
||
| (3 intermediate revisions by 2 users not shown) | |||
| Property / author | |||
| Property / author: Alekseĭ Nikolaevich Glebov / rank | |||
| Property / author | |||
| Property / author: Andre Raspaud / rank | |||
| Property / author | |||
| Property / author: Alekseĭ Nikolaevich Glebov / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Andre Raspaud / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 07:53, 5 March 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
