Recommendations
Cites work
- An extension of matching theory
- An extension of Tutte's 1-factor theorem
- Efficient subgraphs packing
- Graph theory
- scientific article; zbMATH DE number 15366 (Why is no real title available?)
- scientific article; zbMATH DE number 3534506 (Why is no real title available?)
- scientific article; zbMATH DE number 3570478 (Why is no real title available?)
- scientific article; zbMATH DE number 634026 (Why is no real title available?)
- Matching theory
- On factors with given components
- On matroids induced by packing subgraphs
- On the Complexity of General Graph Factor Problems
- Packings by cliques and by finite families of graphs
- Packings by Complete Bipartite Graphs
Cited in
(17)- Generalized edge packings
- Induced star partition of graphs
- Linear-vertex kernel for the problem of packing r-stars into a graph without long induced paths
- On packing 3-vertex paths in a graph
- scientific article; zbMATH DE number 5999574 (Why is no real title available?)
- scientific article; zbMATH DE number 5126095 (Why is no real title available?)
- scientific article; zbMATH DE number 568827 (Why is no real title available?)
- Packing $k$-Matchings and $k$-Critical Graphs
- On the Maximum Induced Density of Directed Stars and Related Problems
- On star-packings having a large matching
- Induced graph packing problems
- Star covers and star partitions of double-split graphs
- Packing 3-vertex paths in claw-free graphs and related topics
- On star partition of split graphs
- Star covers and star partitions of cographs and butterfly-free graphs
- Packing in honeycomb networks
- Graph factors and factorization: 1985--2003: a survey
This page was built for publication: Optimal packing of induced stars in a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1367032)
