Every planar graph without cycles of length 4 or 9 is \((1, 1, 0)\)-colorable (Q2359954): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 17:24, 2 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Every planar graph without cycles of length 4 or 9 is \((1, 1, 0)\)-colorable |
scientific article |
Statements
Every planar graph without cycles of length 4 or 9 is \((1, 1, 0)\)-colorable (English)
0 references
23 June 2017
0 references
planar graph
0 references
generalized Steinberg's conjecture
0 references
\((1, 1, 0)\)-coloring
0 references
cycles
0 references
discharging
0 references
