The 3-colorability of planar graphs without cycles of length 4, 6 and 9 (Q501066)
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 6492155
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The 3-colorability of planar graphs without cycles of length 4, 6 and 9 |
scientific article; zbMATH DE number 6492155 |
Statements
The 3-colorability of planar graphs without cycles of length 4, 6 and 9 (English)
0 references
8 October 2015
0 references
planar graph
0 references
vertex coloring
0 references
Steinberg's conjecture
0 references
0 references
0 references
0.9724677
0 references
0.96658146
0 references
0.95198214
0 references
0.94134015
0 references
0.94120526
0 references
0 references
0.9390805
0 references
0 references
0.9309047
0 references
0.9306353
0 references
