Improved upper bound for generalized acyclic chromatic number of graphs (Q1617036)
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 6974667
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Improved upper bound for generalized acyclic chromatic number of graphs |
scientific article; zbMATH DE number 6974667 |
Statements
Improved upper bound for generalized acyclic chromatic number of graphs (English)
0 references
7 November 2018
0 references
girth
0 references
coloring
0 references
acyclic coloring
0 references
\(r\)-acyclic coloring
0 references
lopsided local lemma
0 references
0.9496652483940125
0 references
0.9351051449775696
0 references
0.9339203834533693
0 references
0.8969538807868958
0 references
0.8789371848106384
0 references
