On the spanning tree polyhedron
- 28 February 1989
- journal article
- Published by Elsevier in Operations Research Letters
- Vol. 8 (1) , 25-29
- https://doi.org/10.1016/0167-6377(89)90029-1
Abstract
No abstract availableThis publication has 6 references indexed in Scilit:
- Matroids and the greedy algorithmMathematical Programming, 1971
- Blocking and anti-blocking pairs of polyhedraMathematical Programming, 1971
- Lehmans switching game and a theorem of Tutte and Nash-WilliamsJournal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, 1965
- Minimum partition of a matroid into independent subsetsJournal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, 1965
- On the Problem of Decomposing a Graph into n Connected FactorsJournal of the London Mathematical Society, 1961
- Edge-Disjoint Spanning Trees of Finite GraphsJournal of the London Mathematical Society, 1961