Induced graph packing problems
From MaRDI portal
Publication:604669
DOI10.1007/S00373-010-0906-0zbMATH Open1230.05236OpenAlexW2034740022MaRDI QIDQ604669FDOQ604669
Authors: 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
Recommendations
- Graph packings
- scientific article; zbMATH DE number 1022391
- scientific article; zbMATH DE number 4061279
- Packing parameters in graphs
- The graph-bin packing problem
- Packings in complete graphs
- Packing of graphs - a survey
- Packing problems in edge-colored graphs
- Independent packings in structured graphs
- Packing graphs in their complements
Cites Work
- On the Complexity of General Graph Factor Problems
- Paths, Trees, and Flowers
- Optimal packing of induced stars in a graph
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Transversals and matroid partition
- Title not available (Why is that?)
- Title not available (Why is that?)
- The Factors of Graphs
- Subgraphs with prescribed valencies
- Packing subgraphs in a graph
- Systems of Distinct Representations and Linear Programming
- Title not available (Why is that?)
- Perfect triangle-free 2-matchings
- An extension of matching theory
- On matroids induced by packing subgraphs
- An extension of Tutte's 1-factor theorem
- Efficient subgraphs packing
- Some Generalizations of the Problem of Distinct Representatives
- Title not available (Why is that?)
Cited In (4)
This page was built for publication: Induced graph packing problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q604669)
