The 3-colorability of planar graphs without cycles of length 4, 6 and 9 (Q501066)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The 3-colorability of planar graphs without cycles of length 4, 6 and 9 |
scientific article |
Statements
The 3-colorability of planar graphs without cycles of length 4, 6 and 9 (English)
0 references
8 October 2015
0 references
planar graph
0 references
vertex coloring
0 references
Steinberg's conjecture
0 references
0 references
0 references
