On matroids induced by packing subgraphs

DOI10.1016/0095-8956(88)90042-1zbMath0655.05054MaRDI QIDQ1109053

Martin Loebl, Svatopluk Poljak

Publication date: 1988

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(88)90042-1

zbMATH Keywords

1-factor; matroids; general factors

Mathematics Subject Classification ID

05C10: Planar graphs; geometric and topological aspects of graph theory

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

05B35: Combinatorial aspects of matroids and geometric lattices

05C99: Graph theory

Related Items

Unnamed Item, Induced graph packing problems, Good characterizations for some degree constrained subgraphs, Optimal packing of induced stars in a graph, Gadget classification, About a new class of matroid-inducing packing families

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On factors with given components
• On certain classes of fractional matchings
• An extension of matching theory
• Packings by cliques and by finite families of graphs
• Packing subgraphs in a graph
• An extension of Tutte's 1-factor theorem
• On the Complexity of General Graph Factor Problems
• Packings by Complete Bipartite Graphs
• Integer and Fractional Matchings
• Paths, Trees, and Flowers
• Transversals and matroid partition