Planar graphs without cycles of length from 4 to 7 are 3-colorable (Q1767673): 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: Andre Raspaud / rank | |||
| Property / author | |||
| Property / author: Mohammad R. Salavatipour / rank | |||
Revision as of 23:59, 11 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Planar graphs without cycles of length from 4 to 7 are 3-colorable |
scientific article |
Statements
Planar graphs without cycles of length from 4 to 7 are 3-colorable (English)
0 references
8 March 2005
0 references
Planar graphs
0 references
3-coloring
0 references
Steinberg's conjecture
0 references
