42 citations · 153 across the 70 of their papers we have counts for
Showing 2014Show all
3 papers · 1 filter
math.CO2014★ 2 cited
Coloring, sparseness, and girth
Noga Alon, Alexandr Kostochka, Benjamin Reiniger +2
An -augmented tree is a rooted tree plus edges added from each leaf to ancestors. For , we construct a bipartite -augmented complete -ary tree havi…
math.CO2014★ 3 cited
Lower bounds for on-line graph colorings
Grzegorz Gutowski, Jakub Kozik, Piotr Micek +1
We propose two strategies for Presenter in on-line graph coloring games. The first one constructs bipartite graphs and forces any on-line coloring algorithm to use …
math.CO2014★ 3 cited
On (4,2)-Choosable Graphs
Jixian Meng, Gregory J. Puleo, Xuding Zhu
A graph is called -choosable if for any list assignment which assigns to each vertex a set of permissible colours, there is a -tuple -colouring…