Author:
Bauer D.,van den Heuvel J.,Morgana A.,Schmeichel E.
Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference25 articles.
1. NP-completeness of the hamiltonian cycle problem for bipartite graphs;Akiyama;J. Inform. Proc.,1980
2. The smallest 2-connected cubic bipartite planar nonhamiltonian graph;Asano;Discrete Math.,1982
3. Recognizing tough graphs is NP-hard;Bauer;Discrete Appl. Math.,1990
4. On the complexity of recognizing tough graphs;Bauer;Discrete Math.,1994
5. Graph Theory with Applications;Bondy,1976
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献