Subject
Geometry and Topology,Discrete Mathematics and Combinatorics
Reference21 articles.
1. A linear algorithm for finding Hamiltonian cycles in 4-connected maximal planar graphs
2. Geometric structures for three-dimensional shape representation
3. and . Graph Theory with Applications. North-Holland, New York (1976).
4. Hamiltonian cycles. The Traveling Salesman Problem, John Wiley & Sons, New York (1985) chap. 11, pp. 403–429.
5. Tough graphs and hamiltonian circuits
Cited by
21 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献