2 citations · 5 across the 6 of their papers we have counts for
1 paper · 2 filters
Lefteris Kirousis, John Livieratos
The acyclic chromatic number of a graph is the least number of colors needed to properly color its vertices so that none of its cycles has only two colors. We show that for all $α>…