Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference21 articles.
1. Factors and Factorizations of Graphs: Proof Techniques in Factor Theory;Akiyama,2011
2. Chordal graphs and some of their derived graphs;Balakrishnan,1986
3. Long cycles in graphs with prescribed toughness and minimum degree;Bauer;Discrete Math.,1995
4. Not every 2-tough graph is Hamiltonian;Bauer,2000
5. More than one tough chordal planar graphs are Hamiltonian;Böhme;J. Graph Theory,1999
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献