Planar graphs without cycles of length 4 or 5 are (3,0,0)-colorable (Q393460)
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 6249357
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Planar graphs without cycles of length 4 or 5 are (3,0,0)-colorable |
scientific article; zbMATH DE number 6249357 |
Statements
Planar graphs without cycles of length 4 or 5 are (3,0,0)-colorable (English)
0 references
23 January 2014
0 references
planar graph
0 references
Steinberg's conjecture
0 references
improper coloring
0 references
0 references
0.9474984407424928
0 references
0.9434802532196044
0 references
0.9370340704917908
0 references
0.9360055923461914
0 references
0.9348040819168092
0 references
