Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference12 articles.
1. Conditions for the existence of hamiltonian circuits in graphs based on vertex degrees;Ainouche;J. London Math. Soc.,1985
2. Über Hamiltonsche Kreise und unabhängige Ecken in Graphen;Bigalke;Monatsh. Math.,1979
3. Edge- disjoint hamiltonian circuits in graphs with vertices of large valency;Nash-Williams,1971
4. A generalization of a theorem of Bigalke and Jung;Bauer;Ars Combin.,1988
5. Long cycle in graphs with large degree sums;Bauer;Discrete Math.,1989
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Toughness in Graphs – A Survey;Graphs and Combinatorics;2006-04