Every planar graph with cycles of length neither 4 nor 5 is \((1,1,0)\)-colorable (Q489724)
From MaRDI portal
!
WARNING
This is the item page for this Wikibase entity, intended for internal use and editing purposes.
Please use the normal view instead:
scientific article; zbMATH DE number 6388497
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Every planar graph with cycles of length neither 4 nor 5 is \((1,1,0)\)-colorable |
scientific article; zbMATH DE number 6388497 |
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
0.9348040819168092
0 references
0.9322481155395508
0 references
0.9314841032028198
0 references
0.9295905232429504
0 references
0.9285666346549988
0 references
