\((1,0,0)\)-colorability of planar graphs without cycles of length 4, 5 or 9 (Q2449153)
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 6292571
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | \((1,0,0)\)-colorability of planar graphs without cycles of length 4, 5 or 9 |
scientific article; zbMATH DE number 6292571 |
Statements
\((1,0,0)\)-colorability of planar graphs without cycles of length 4, 5 or 9 (English)
0 references
6 May 2014
0 references
planar graph
0 references
Steinberg conjecture
0 references
cycle
0 references
improper coloring
0 references
0 references
0 references
0.921546995639801
0 references
0.920894742012024
0 references
0.9194435477256776
0 references
0.9115581512451172
0 references
0.9111421704292296
0 references
