Recommendations
Cites work
- 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?)
- An extension of Tutte's 1-factor theorem
- An extension of matching theory
- Efficient subgraphs packing
- Graph theory
- Matching theory
- On factors with given components
- On matroids induced by packing subgraphs
- On the Complexity of General Graph Factor Problems
- Packings by Complete Bipartite Graphs
- Packings by cliques and by finite families of graphs
Cited in
(16)- Linear-vertex kernel for the problem of packing r-stars into a graph without long induced paths
- scientific article; zbMATH DE number 5999574 (Why is no real title available?)
- scientific article; zbMATH DE number 5126095 (Why is no real title available?)
- On star-packings having a large matching
- On the Maximum Induced Density of Directed Stars and Related Problems
- Induced graph packing problems
- Packing 3-vertex paths in claw-free graphs and related topics
- Packing in honeycomb networks
- Induced star partition of graphs
- Generalized edge packings
- Graph factors and factorization: 1985--2003: a survey
- Packing $k$-Matchings and $k$-Critical Graphs
- Star covers and star partitions of double-split graphs
- On star partition of split graphs
- Star covers and star partitions of cographs and butterfly-free graphs
- On packing 3-vertex paths in a graph
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)
