1. ISGCI,
http://www.graphclasses.org/smallgraphs.html.
2. E. Birmelé, J. A. Bondy and B. Reed: The Erdős-Pósa property for long circuits, Combinatorica
27 (2007), 135–145.
3. H. Bruhn, F. Joos and O. Schaudt: Long cycles through prescribed vertices have the Erdős-Pósa property, J. Graph Theory
87 (2018), 275–284.
4. D. Conlon and J. Fox: Graph removal lemmas, Surveys in combinatorics 2013, London Math. Soc. Lecture Note Ser., vol. 409, Cambridge Univ. Press, Cambridge, 2013, 1–49.
5. I. J. Dejter and V. Neumann-Lara: Unboundedness for generalized odd cyclic transversality, Colloq. Math. Soc. János Bolyai
52 (1987), 195–203.