Every planar graph without 4-cycles and 5-cycles is \((2, 6)\)-colorable (Q1988563): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s40840-019-00819-4 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2965948659 / rank | |||
Normal rank | |||
Revision as of 22:09, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Every planar graph without 4-cycles and 5-cycles is \((2, 6)\)-colorable |
scientific article |
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
