Every planar graph with cycles of length neither 4 nor 5 is \((1,1,0)\)-colorable (Q489724): Difference between revisions
From MaRDI portal
Normalize DOI. |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/S10878-012-9586-4 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S10878-012-9586-4 / rank | |||
Normal rank | |||
Latest revision as of 19:10, 9 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Every planar graph with cycles of length neither 4 nor 5 is \((1,1,0)\)-colorable |
scientific article |
Statements
Every planar graph with cycles of length neither 4 nor 5 is \((1,1,0)\)-colorable (English)
0 references
21 January 2015
0 references
planar graph
0 references
Steinberg's conjecture
0 references
improper coloring
0 references
0 references
