Graphs with maximum degree \(6\) are acyclically \(11\)-colorable (Q1944128): 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.1016/j.ipl.2011.05.005 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2066184526 / rank | |||
Normal rank | |||
Revision as of 01:27, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Graphs with maximum degree \(6\) are acyclically \(11\)-colorable |
scientific article |
Statements
Graphs with maximum degree \(6\) are acyclically \(11\)-colorable (English)
0 references
4 April 2013
0 references
combinatorial problems
0 references
graph coloring
0 references
bounded degree graphs
0 references
acyclic coloring
0 references
vertex coloring
0 references
