Improved upper bound for acyclic chromatic number of graphs. (Q5206433)
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: Improved upper bound for acyclic chromatic number of graphs. |
scientific article; zbMATH DE number 7144851
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Improved upper bound for acyclic chromatic number of graphs. |
scientific article; zbMATH DE number 7144851 |
Statements
18 December 2019
0 references
girth
0 references
coloring
0 references
acyclic coloring
0 references
lefthanded local lemma
0 references
0.9351051449775696
0 references
0.9350123405456544
0 references
0.9171982407569884
0 references
0.9102053642272948
0 references
0.8983702063560486
0 references
