Author:
Ellingham M.N.,Nowbandegani Pouria Salehi,Shan Songling
Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference12 articles.
1. Not every 2-tough graph is Hamiltonian;Bauer;Discrete Appl. Math.,2000
2. Hamiltonian Graphs in Selected Topics in Graph Theory;Bermond,1978
3. Tough graphs and hamiltonian circuits;Chvátal;Discrete Math.,1973
4. Complement reducible graphs;Corneil;Discrete Appl. Math.,1981
5. The Chvátal-Erdős condition for prism-hamiltonicity;Ellingham,2018
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献