On matroids induced by packing subgraphs

DOI10.1016/0095-8956(88)90042-1zbMath0655.05054OpenAlexW2092664455MaRDI 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-factormatroidsgeneral factors

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Combinatorial aspects of matroids and geometric lattices (05B35) Graph theory (05C99)

Related Items (11)

Gadget classification ⋮ About a new class of matroid-inducing packing families ⋮ The superstar packing problem ⋮ Optimal packing of induced stars in a graph ⋮ Unnamed Item ⋮ Induced graph packing problems ⋮ Packing $k$-Matchings and $k$-Critical Graphs ⋮ An Edmonds-Gallai-type decomposition for the \(j\)-restricted \(k\)-matching problem ⋮ Good characterizations for some degree constrained subgraphs ⋮ The Nonnegative Node Weight j-Restricted k-Matching Problems ⋮ Strong Algorithms for the Ordinal Matroid Secretary Problem

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

This page was built for publication: On matroids induced by packing subgraphs