Every planar graph without cycles of length 4 or 9 is \((1, 1, 0)\)-colorable (Q2359954): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.disc.2017.04.006 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.DISC.2017.04.006 / rank | |||
Normal rank | |||
Latest revision as of 04:57, 18 December 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
0 references
