Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference20 articles.
1. A. Ainouche, Hamiltonian and traceable claw-free graphs, Report IM 23/89.
2. An improvement of Fraisse's sufficient condition for hamiltonian graphs;Ainouche;J. Graph Theory,1992
3. Remarks on Hamiltonian properties of claw-free graphs;Ainouche;Ars Combin.,1990
4. A generalization of Fan's condition for Hamiltonicity, pancyclicity and Hamiltonian connectedness;Bedrossian;Discrete Math.,1993
5. Toughness and hamiltonicity in almost claw-free graphs;Broersma,1993
Cited by
24 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献