\((1,0,0)\)-colorability of planar graphs without prescribed short cycles (Q498436)
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 6485832
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | \((1,0,0)\)-colorability of planar graphs without prescribed short cycles |
scientific article; zbMATH DE number 6485832 |
Statements
\((1,0,0)\)-colorability of planar graphs without prescribed short cycles (English)
0 references
28 September 2015
0 references
planar graph
0 references
Steinberg conjecture
0 references
improper coloring
0 references
cycle
0 references
0 references
0 references
0.920547902584076
0 references
0.9180708527565002
0 references
0.9130564332008362
0 references
0.911346435546875
0 references
0.9075156450271606
0 references
