Planar graphs without cycles of length 4 or 5 are \((2, 0, 0)\)-colorable (Q898156)
From MaRDI portal
!
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 6517695
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Planar graphs without cycles of length 4 or 5 are \((2, 0, 0)\)-colorable |
scientific article; zbMATH DE number 6517695 |
Statements
Planar graphs without cycles of length 4 or 5 are \((2, 0, 0)\)-colorable (English)
0 references
8 December 2015
0 references
Steinberg's conjecture
0 references
improper coloring
0 references
bad cycles
0 references
super extension
0 references
discharging
0 references
0 references
0 references
0 references
0.9549847841262816
0 references
0.9456798434257508
0 references
0.9434802532196044
0 references
0.933082103729248
0 references
0.9322481155395508
0 references
