1. The strong perfect graph theorem;Chudnovsky;Ann. of Math.,2006
2. Graph theory and probability;Erdős;Canad. J. Math.,1959
3. Computers and Intractability: A Guide to the Theory of NP-Completeness;Garey,1979
4. J. Geelen, Matchings, matroids and unimodular matrices, Ph. D. Thesis, University of Waterloo, 1995.
5. Radius two trees specify χ-bounded classes;Kierstead;J. Graph Theory,1994