Fetching the paper…
Reading the bibliography…
Robin Thomas asked whether for every proper minor-closed class C, there exists a polynomial-time algorithm approximating the chromatic number of graphs from C up to a constant additive error independent on the class C.
H. Grötzsch
1959
Earlier work this paper cites.
M. Garey and D. Johnson
1979
Earlier work this paper cites.
A. Kostochka
1984
Earlier work this paper cites.
N. Robertson and P. D. Seymour
1986
Earlier work this paper cites.
S. Arnborg and A. Proskurowski
1989
Earlier work this paper cites.
C. Thomassen
1993
Earlier work this paper cites.
M. DeVos, G. Ding, B. Oporowski, D. Sanders, B. Reed, P. Seymour, and D. Vertigan
2004
Cited alongside, same era.
E. D. Demaine, M. T. Hajiaghayi, and K.-i. Kawarabayashi
2005
Cited alongside, same era.
2007
Cited alongside, same era.
Conference Graph Theory 2008 at Sandbjerg Manor; slides at http://people.math.gatech.edu/~thomas/SLIDE/beyondgrot.pdf
R. Thomas · 2008
Cited alongside, same era.
E. Demaine, M. Hajiaghayi, and K.-i. Kawarabayashi
2009
Cited alongside, same era.
K. Kawarabayashi and B. A. Reed
2009
Later among the works it cites.
K.-i. Kawarabayashi, E. D. Demaine, and M. Hajiaghayi
2009
Later among the works it cites.
M. Molloy and B. Reed
2013
Later among the works it cites.
Z. Dvořák and R. Thomas
2014
Later among the works it cites.
Z. Dvořák, D. Král’, and R. Thomas
2016
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…