Every planar graph with cycles of length neither 4 nor 5 is \((1,1,0)\)-colorable (Q489724): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10878-012-9586-4 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2011909118 / rank | |||
Normal rank | |||
Latest revision as of 22:29, 19 March 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
