Publisher
Springer Science and Business Media LLC
Subject
General Mathematics,Software
Reference8 articles.
1. V. Chvátal, “Tough graphs and hamiltonian circuits”,Discrete Mathematics 5 (1973), to appear.
2. V. Chvátal, “Edmonds polytopes and a hierarchy of combinatorial problems”,Discrete Mathematics 5 (1973) 305–337.
3. G. Dantzig, R. Fulkerson and S. Johnson, “Solution of a large-scale traveling salesman problem”,Operations Research 2 (1954) 393–410.
4. J. Edmonds, “Maximum matching and a polyhedron with 0, 1-vertices”,Journal of Research of the National Bureau of Standards 69B (1965) 125–130.
5. F. Harary,Graph theory (Addison-Wesley, Reading, Mass., 1969).
Cited by
126 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献