Induced graph packing problems

DOI10.1007/s00373-010-0906-0zbMath1230.05236OpenAlexW2034740022MaRDI QIDQ604669

Zoltán Király, Jácint Szabó

Publication date: 12 November 2010

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-010-0906-0

zbMATH Keywords

matchinggraph packingGallai-Edmonds structure theorem

Mathematics Subject Classification ID

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

Related Items

Packing $k$-Matchings and $k$-Critical Graphs

Cites Work

• An extension of matching theory
• On matroids induced by packing subgraphs
• Packing subgraphs in a graph
• An extension of Tutte's 1-factor theorem
• Efficient subgraphs packing
• Optimal packing of induced stars in a graph
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• On the Complexity of General Graph Factor Problems
• Systems of Distinct Representations and Linear Programming
• Some Generalizations of the Problem of Distinct Representatives
• Perfect triangle-free 2-matchings
• Paths, Trees, and Flowers
• Transversals and matroid partition
• Subgraphs with prescribed valencies
• The Factors of Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item