Every planar graph without 4-cycles and 5-cycles is \((2, 6)\)-colorable (Q1988563)
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: Every planar graph without 4-cycles and 5-cycles is \((2, 6)\)-colorable |
scientific article; zbMATH DE number 7192855
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Every planar graph without 4-cycles and 5-cycles is \((2, 6)\)-colorable |
scientific article; zbMATH DE number 7192855 |
Statements
Every planar graph without 4-cycles and 5-cycles is \((2, 6)\)-colorable (English)
0 references
23 April 2020
0 references
improper coloring
0 references
planar graph
0 references
discharging method
0 references
0 references
0 references
0 references
