1. Long cycles in graphs with prescribed toughness and minimum degree;Bauer;Discrete Math.,1995
2. J.A. Bondy, Longest paths and cycles in graphs of high degree, Research Report CORR80-16, University of Waterloo, Waterloo, Ontario, 1980.
3. A Generalisation of Ore’s Theorem involving neighbourhoods unions;Broersma;Discrete Math.,1993
4. E. DeLavina, Written on the Wall II (Conjectures of Graffiti.pc), http://cms.dt.uh.edu/faculty/delavinae/research/wowII/. Vol. 104, pp. 167–183.
5. E. DeLaviña, S. Fajtlowicz, D.B. West, On conjectures of Griggs and Graffiti, DIMACS volume, in: Graphs and Discovery: Proceedings of the 2001 Working Group on Computer-Generated Conjectures from Graph Theoretic and Chemical Databases, Vol. 69, 2005, pp. 119–125.