Every planar graph with cycles of length neither 4 nor 5 is \((1,1,0)\)-colorable (Q489724): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claims |
||
| Property / author | |||
| Property / author: Zheng-Ke Miao / rank | |||
| Property / author | |||
| Property / author: Ying Qian Wang / rank | |||
Revision as of 09:44, 20 February 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
