References
- M. Aung, Longest cycles in triangle-free graphs, Journal of Combinatorial Series B 47(2) (1989), 171–186.
- D. Bauer, N. Kahl, L. McGuire, and E. Schmeichel, Long cycles in 2-connected triangle-free graphs, Ars Combinatoria 86 (2008), 295–304.
- S. Brandt, Cycles and paths in triangle-free graphs, In: The mathematics of Paul Erdős, II, Algorithms and Combinatorics, Vol. 14, pp. 32–42, Springer, Berlin, 1997.
- H.J. Broersma, J. van den Heuvel, and H.J. Veldman, A generalisation of Ore’s Theorem involving neighbourhood unions, Discrete Mathematics 122 (1993), 37–49.
- E. DeLavina, Written on the wall II (Conjectures of Graffiti.pc), http://cms.dt.uh.edu/faculty/delavinae/research/wow II/ 104 (2005), 167–183.
- G.A. Dirac, Some theorems on abstract graphs, Proceedings of the London Mathematical Society 2 (1952), 69–81.
- R. Faudree, E. Flandrin, and Z. Ryjáček, Claw-free graphs-a survey, Discrete Mathematics 164 (1997), 87–147.
- L.M. Fernandes and L. Gouvea, Minimal spanning trees with a constraint on the number of leaves, European Journal of Operational Research 104 (1998), 250–261.
- M.R. Garey and D.S. Johnson, Computers and intractability: A guide to the theory of NP-completeness, W.H. Freeman and Company, San Francisco, CA, 1979.
- R.J. Gould, Advances on Hamiltonian problem-A survey, Graphs and Combinatorics 19(1) (2003), 7–52.
- F. Hilbig, Kantenstruckturen in nichthamiltonschen Graphen, Ph.D. Thesis, Technische Universität, Berlin, Germany, 1986.
- B. Jackson, Neighbourhood unions and Hamilton cycles, Journal of Graph Theory 15 (1991), 443–451.
- H. Li, Hamiltonian cycles in 2-connected claw-free graphs, Journal of Graph Theory 20 (1995), 447–457.
- P. Mafuta, Leaf number and Hamiltonian C4-free graphs, Afrika Matematika (2017), DOI: 10.1007/s13370-017-0503-y.
- P. Mafuta and S. Mukwembi, On minimum degree, leaf number, traceability and Hamiltonicity in graphs, Discrete Applied Mathematics 221 (2017), 89–94.
- P. Mafuta, S. Mukwembi, and S. Munyira, Spanning paths in graphs, Discrete Applied Mathematics (2018), https://doi.org/10.1016/j.dam.2018.08.001.
- P. Mafuta, S. Mukwembi, S. Munyira, and T. Vetrík, Hamiltonicity, leaf number and minimum degree, Acta Mathematica Hungarica 152(1) (2017), 217–226.
- S. Mukwembi, Minimum degree, leaf number and traceability, Czechoslovak Mathematical Journal 63(138) (2013), 539–545.
- S. Mukwembi, On Spanning cycles, paths and trees, Discrete Applied Mathematics 161 (2013), 2217–2222.
- S. Mukwembi, Minimum degree, leaf number, and Hamiltonicity, American Mathematical Monthly 120(02) (2013), 115.
- J.A. Nash-Williams, Edge-disjoint hamiltonian circuits in graphs with vertices of large valency, Studies in Pure Mathematics, pp. 157–183, Academic Press, London, 1971.
- Zh.G. Nikoghosyan, Graph invariants and large cycles: A survey, International Journal of Mathematics and Mathematical Sciences 2011 (2011), Article ID 206404, 11 pages, doi: 10.1155/2011/206404.
- S. Ren, A sufficient condition for graphs with large neighbourhoods unions to be traceable, Discrete Mathematics 161 (1996), 229–234.
- O. Ore, 1960, A note on Hamiltonian circuits, American Mathematical Monthly 67 55.
- K. Ozeki and T. Yamashita, Spanning trees-A survey, Graphs and Combinatorics 27 (2011), 1–26.
- K. Ozeki and T. Yamashita, Length of longest cycles in a graph whose relative length is at least two, Graphs and Combinatorics 28 (2012), 859–868.