3 citations · 6 across the 10 of their papers we have counts for
Showing 2011Show all
2 papers · 1 filter
cs.DM2011
Fixed parameter algorithms for restricted coloring problems
Victor Campos, Cláudia Linhares-Sales, Ana Karolinna Maia +2
In this paper, we obtain polynomial time algorithms to determine the acyclic chromatic number, the star chromatic number, the Thue chromatic number, the harmonious chromatic number…
math.CO2011★ 2 cited
5-choosability of graphs with 2 crossings
Victor Campos, Frédéric Havet
We show that every graph with two crossings is 5-choosable. We also prove that every graph which can be made planar by removing one edge is 5-choosable.