Author:
Ryjáček Zdeněk,Woeginger Gerhard J.,Xiong Liming
Funder
Czech Ministry of Education
Natural Science Funds of China
Beijing Natural Science Foundation
Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference12 articles.
1. The edge hamiltonian path problem is NP-complete;Bertossi;Inform. Process. Lett.,1981
2. On hamiltonian line graphs;Chartrand;Trans. Amer. Math. Soc.,1968
3. Computers and Intractability, A Guide to the Theory of NP-Completeness;Garey,1979
4. The planar hamiltonian circuit problem is NP-complete;Garey;SIAM J. Comput.,1976
5. On eulerian and hamiltonian graphs and line graphs;Harary;Canad. Math. Bull.,1965
Cited by
19 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献