Edmonds polytopes and weakly hamiltonian graphs
Author:
- 1 December 1973
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 5 (1) , 29-40
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Tough graphs and hamiltonian circuitsDiscrete Mathematics, 1973
- Edmonds polytopes and a hierarchy of combinatorial problemsDiscrete Mathematics, 1973
- GRAPH THEORY1969
- Cycles and Connectivity in GraphsCanadian Journal of Mathematics, 1967
- Maximum matching and a polyhedron with 0,1-verticesJournal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, 1965
- The Factors of GraphsCanadian Journal of Mathematics, 1952