\((1,0,0)\)-colorability of planar graphs without prescribed short cycles (Q498436)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | \((1,0,0)\)-colorability of planar graphs without prescribed short cycles |
scientific article |
Statements
\((1,0,0)\)-colorability of planar graphs without prescribed short cycles (English)
0 references
28 September 2015
0 references
planar graph
0 references
Steinberg conjecture
0 references
improper coloring
0 references
cycle
0 references
0 references
0 references
