\((1,0,0)\)-colorability of planar graphs without cycles of length 4, 5 or 9 (Q2449153)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | \((1,0,0)\)-colorability of planar graphs without cycles of length 4, 5 or 9 |
scientific article |
Statements
\((1,0,0)\)-colorability of planar graphs without cycles of length 4, 5 or 9 (English)
0 references
6 May 2014
0 references
planar graph
0 references
Steinberg conjecture
0 references
cycle
0 references
improper coloring
0 references
0 references
0 references
