Author:
Mafuta P.,Mazorodze J. P.,Munyira S.,Mushanyu J.
Publisher
Springer Science and Business Media LLC
Reference20 articles.
1. Aung, M.: Longest cycles in triangle-free graphs. J. Combin. Theory Ser. B 47(2), 171–186 (1989)
2. Bauer, D., Kahl, N., McGuire, L., Schmeichel, E.: Long cycles in 2-connected triangle-free graphs. Ars Comb. 86, 295–304 (2008)
3. Brandt, S.: Cycles and paths in triangle-free graphs. In: The mathematics of Paul Erdős, II, volume 14 of Algorithms Combin, pp. 32–42. Springer, Berlin (1997)
4. Broersma, H.J., van den Heuvel, J., Veldman, H.J.: A generalisation of Ore’s theorem involving neighbourhoods unions. Discrete Math. 122, 37–49 (1993)
5. Dirac, G.A.: Some theorems on abstract graphs. Proc. Lond. Math. Soc. 2, 69–81 (1952)