On Packing Connectors

Journal of Combinatorial Theory. Series B

Volumn 73, Issue 2, 1998, Pages 184-188

  Keijsper, J ^a   Schrijver, A ^a,b  

^a UNIVERSITY OF AMSTERDAM   (Netherlands)

^b CWI   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0038901813     PISSN: 00958956     EISSN: None     Source Type: Journal    
DOI: 10.1006/jctb.1998.1825     Document Type: Article

References (10)

1. Barahona F. Packing spanning trees. Math. Oper. Res. 20:1995;104-115.
2. Gupta R. P. A decomposition theorem for bipartite graphs. Theory of Graphs. 1967;Gordon & Breach, New York. p. 135-138.
3. Keijsper J. Report. 1997.
4. J. Keijsper, R. Pendavingh, An efficient algorithm for minimum-weight bibranching, J. Combin. Theory Ser. B.
5. König D. Über Graphen und ihre Anwendung auf Determinantentheorie und Mengenlehre. Math. Ann. 77:1916;453-465.
6. Nash-Williams C. St. J. A. Edge-disjoint spanning trees of finite graphs. J. London Math. Soc. 36:1961;445-450.
7. Schrijver A. Min-max relations for directed graphs. Ann. Discrete Math. 16:1982;261-280.
8. Schrijver A. Theory of Linear and Integer Programming. 1986;Wiley, Chichester.
9. Tutte W. T. On the problem of decomposing a graph inton. J. London Math. Soc. 36:1961;221-230.
10. Welsh D. J. A. Matroid Theory. 1976;Academic Press, London.