Every planar graph without 5-cycles and \(K_4^-\) and adjacent 4-cycles is \((2, 0, 0)\)-colorable (Q2279984)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Every planar graph without 5-cycles and \(K_4^-\) and adjacent 4-cycles is \((2, 0, 0)\)-colorable |
scientific article |
Statements
Every planar graph without 5-cycles and \(K_4^-\) and adjacent 4-cycles is \((2, 0, 0)\)-colorable (English)
0 references
17 December 2019
0 references
coloring
0 references
planar graphs
0 references
Steinberg conjecture
0 references
improper coloring
0 references
discharging
0 references
superextendable
0 references
