Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference14 articles.
1. Not every 2-tough graph is hamiltonian;Bauer;Discrete Appl. Math.,2000
2. Hamiltonian graphs;Bermond,1978
3. More than one tough chordal planar graphs are hamiltonian;Böhme;J. Graph Theory,1999
4. Tough graphs and Hamiltonian circuits;Chvátal;Discrete Math.,1973
5. R. Diestel, Graph Theory, Graduate Texts in Mathematics, Vol. 173, Springer, Berlin, 1997.
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献