Induced graph packing problems
From MaRDI portal
Publication:604669
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
- scientific article; zbMATH DE number 554155 (Why is no real title available?)
- scientific article; zbMATH DE number 1033810 (Why is no real title available?)
- scientific article; zbMATH DE number 3220175 (Why is no real title available?)
- scientific article; zbMATH DE number 3195967 (Why is no real title available?)
- An extension of Tutte's 1-factor theorem
- An extension of matching theory
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Efficient subgraphs packing
- On matroids induced by packing subgraphs
- On the Complexity of General Graph Factor Problems
- Optimal packing of induced stars in a graph
- Packing subgraphs in a graph
- Paths, Trees, and Flowers
- Perfect triangle-free 2-matchings
- Some Generalizations of the Problem of Distinct Representatives
- Subgraphs with prescribed valencies
- Systems of Distinct Representations and Linear Programming
- The Factors of Graphs
- Transversals and matroid partition
Cited in
(5)
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)