Planar graphs without cycles of length 4 or 9 are $\boldsymbol{(2,~0,~0)}$-colorable (Q5064172)
From MaRDI portal
scientific article; zbMATH DE number 7494870
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
