12 citations · 15 across the 2 of their papers we have counts for
2 papers
math.CO2018★ 12 cited
Four-coloring -free graphs. II. Finding an excellent precoloring
Maria Chudnovsky, Sophie Spirkl, Mingxian Zhong
This is the second paper in a series of two. The goal of the series is to give a polynomial time algorithm for the -coloring problem and the -precoloring extension problem re…
math.CO2018★ 3 cited
Four-coloring -free graphs. I. Extending an excellent precoloring
Maria Chudnovsky, Sophie Spirkl, Mingxian Zhong
This is the first paper in a series whose goal is to give a polynomial time algorithm for the -coloring problem and the -precoloring extension problem restricted to the class…