An Algorithm for Packing Connectors

Journal of Combinatorial Theory. Series B

Volumn 74, Issue 2, 1998, Pages 397-404

  Keijsper, J ^a  

^a UNIVERSITY OF AMSTERDAM   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

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

References (8)

1. Davies J., McDiarmid C. J. H. Disjoint common transversals and exchange structures. J. London Math. Soc. (2). 14:1976;55-62.
2. Gabow H. N., Westermann H. H. Forests, frames, and games: Algorithms for matroid sums and applications. Algorithmica. 7:1992;465-497.
3. Gupta R. P. A decomposition theorem for bipartite graphs. Theory of Graphs. 1967;Gordon and Breach, New York. p. 135-138.
4. Keijsper J., Schrijver A. On packing connectors. J. Combin. Theory Ser. B. 73:1998;184-188.
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. Tutte W. T. On the problem of decomposing a graph inton. J. London Math. Soc. 36:1961;221-230.
8. Welsh D. J. A. Matroid Theory. 1976;Academic Press, London.