Planar graphs with neither 5-cycles nor close 3-cycles are 3-colorable (Q3067058)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Planar graphs with neither 5-cycles nor close 3-cycles are 3-colorable |
scientific article |
Statements
Planar graphs with neither 5-cycles nor close 3-cycles are 3-colorable (English)
0 references
20 January 2011
0 references
planar graphs
0 references
coloring
0 references
Havel's problem
0 references
