Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference9 articles.
1. Graph Theory;Diestel,1997
2. Paths, trees and flowers;Edmonds;Canad. J. Math.,1965
3. Computers and Intractability: A Guide to the Theory of NP-Completeness;Garey,1979
4. The planar Hamilton circuit problem is NP-Complete;Garey;SIAM J. Comput.,1976
5. On representatives of subsets;Hall;J. London Math. Soc.,1935
Cited by
13 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献