On a packing problem for infinite graphs and independence spaces
From MaRDI portal
Publication:754225
DOI10.1016/0095-8956(79)90050-9zbMath0416.05030MaRDI QIDQ754225
Publication date: 1979
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(79)90050-9
05C05: Trees
05B35: Combinatorial aspects of matroids and geometric lattices
05C99: Graph theory
05B40: Combinatorial aspects of packing and covering
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Transversal theory. An account of some aspects of combinatorial mathematics
- Über drei kombinatorische Probleme am \(n\)-dimensionalen Würfel und Würfelgitter
- On the Problem of Decomposing a Graph into n Connected Factors
- Edge-Disjoint Spanning Trees of Finite Graphs
- Transversals and matroid partition
- Infinite graphs—A survey
- Lehmans switching game and a theorem of Tutte and Nash-Williams
- Matroids and duality
- Admissible Mappings between Dependence Spaces
- On Families of Finite Independence Structures
- Sur la Dualite en Theorie des Matroides