Graphs with maximum degree \(6\) are acyclically \(11\)-colorable (Q1944128)
From MaRDI portal
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
