Graphs with maximum degree \(6\) are acyclically \(11\)-colorable (Q1944128)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6150434
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Graphs with maximum degree \(6\) are acyclically \(11\)-colorable |
scientific article; zbMATH DE number 6150434 |
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
0.93261015
0 references
0.9183253
0 references
0.91126233
0 references
0.9009459
0 references
0.8856086
0 references
0.88487124
0 references
0.87983084
0 references
0.8781869
0 references
0.8781525
0 references
0.87007713
0 references
