Planar graphs without cycles of length 4 or 9 are $\boldsymbol{(2,~0,~0)}$-colorable (Q5064172)
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 7494870
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Planar graphs without cycles of length 4 or 9 are $\boldsymbol{(2,~0,~0)}$-colorable |
scientific article; zbMATH DE number 7494870 |
Statements
Planar graphs without cycles of length 4 or 9 are $\boldsymbol{(2,~0,~0)}$-colorable (English)
0 references
21 March 2022
0 references
planar graph
0 references
Steinberg's conjecture
0 references
\((2,0,0)\)-coloring
0 references
reducibility
0 references
0.97400737
0 references
0.9560557
0 references
0.95319235
0 references
0.9500414
0 references
0.93642205
0 references
0.93519384
0 references
0.9320698
0 references
0.9309047
0 references
0.92973924
0 references
