Induced graph packing problems
From MaRDI portal
Publication:604669
DOI10.1007/s00373-010-0906-0zbMath1230.05236OpenAlexW2034740022MaRDI QIDQ604669
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
Related Items
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