Subject
General Computer Science,Theoretical Computer Science
Reference17 articles.
1. Finding Hamiltonian cycles in ore graphs;Albertson;Congr. Numer.,1987
2. N. Alon, R. Yuster, U. Zwick, Color-coding: A new method for finding simple paths, cycles and other small subgraphs within large graphs, in: Proceedings of STOC, 1994, pp. 326–335
3. C. Bazgan, M. Santha, Z. Tuza, On the approximability of finding a(nother) Hamiltonian cycles in cubic Hamiltonian graphs, in: Proceedings of STACS, 1998
4. On Hamiltonian walks;Bermond;Util. Math.,1975
5. Finding a path of superlogarithmic length;Björklund;SIAM J. Comput.,2003
Cited by
14 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献