Planar graphs without cycles of length 4 or 5 are (3,0,0)-colorable (Q393460)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Planar graphs without cycles of length 4 or 5 are (3,0,0)-colorable |
scientific article |
Statements
Planar graphs without cycles of length 4 or 5 are (3,0,0)-colorable (English)
0 references
23 January 2014
0 references
planar graph
0 references
Steinberg's conjecture
0 references
improper coloring
0 references
0 references
