Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference17 articles.
1. An improvement of Fraisse’s sufficient condition for hamiltonian graphs;Ainouche;J. Graph Theory,1992
2. A remark on two sufficient conditions for hamilton cycles;Bondy;Discrete Math.,1978
3. Longest paths and cycles in graphs with high degree, Research Report CORR 80-16;Bondy,1980
4. Graph Theory;Bondy,2008
5. Degree conditions for 2-factors;Brandt;J. Graph Theory,1997
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. <i>k</i> Times Petersen Connected Cycles Networks;Advances in Applied Mathematics;2024
2. Isolated toughness for fractional (2;b;k)-critical covered graphs;Proceedings of the Romanian Academy, Series A: Mathematics, Physics, Technical Sciences, Information Science;2023-11-15
3. Disjoint cycles and 2-factors with Fan-type condition in a graph;Discrete Mathematics;2022-04