Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference10 articles.
1. Recognizing tough graphs is NP-hard;Bauer;Discrete Appl. Math.,1990
2. Graph Theory with Applications;Bondy,1976
3. Hamiltonian cycles;Chvátal,1985
4. Tough graphs and Hamiltonian circuits;Chvátal;Discrete Math. Geom.,1973
5. Toughness and Delaunay triangulations;Dillencourt;Discrete Comput. Geom.,1990
Cited by
15 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献