Planar graphs without cycles of length 4 or 5 are \((2, 0, 0)\)-colorable (Q898156)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Planar graphs without cycles of length 4 or 5 are \((2, 0, 0)\)-colorable |
scientific article; zbMATH DE number 6517695
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Planar graphs without cycles of length 4 or 5 are \((2, 0, 0)\)-colorable |
scientific article; zbMATH DE number 6517695 |
Statements
Planar graphs without cycles of length 4 or 5 are \((2, 0, 0)\)-colorable (English)
0 references
8 December 2015
0 references
Steinberg's conjecture
0 references
improper coloring
0 references
bad cycles
0 references
super extension
0 references
discharging
0 references
0 references
0 references
0 references
