On matroids induced by packing subgraphs

DOI10.1016/0095-8956(88)90042-1zbMATH Open0655.05054OpenAlexW2092664455MaRDI QIDQ1109053FDOQ1109053

Authors: 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

Recommendations

• Matroids Induced by Packing Subgraphs
• scientific article; zbMATH DE number 3150
• scientific article; zbMATH DE number 4041936
• About a new class of matroid-inducing packing families
• Induced graph packing problems

zbMATH Keywords

matroids1-factorgeneral factors

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (15)

• Strong algorithms for the ordinal matroid secretary problem
• Title not available (Why is that?)
• Matroids Induced by Packing Subgraphs
• Optimal packing of induced stars in a graph
• Good characterizations for some degree constrained subgraphs
• Families of matroids induced by classes of graphs
• Induced graph packing problems
• The superstar packing problem
• About a new class of matroid-inducing packing families
• Title not available (Why is that?)
• The nonnegative node weight \(j\)-restricted \(k\)-matching problems
• An Edmonds-Gallai-type decomposition for the \(j\)-restricted \(k\)-matching problem
• On packing minors into connected matroids
• Gadget classification
• Packing $k$-Matchings and $k$-Critical Graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1109053)