Optimal packing of induced stars in a graph
From MaRDI portal
Publication:1367032
DOI10.1016/S0012-365X(96)00121-5zbMATH Open0887.05041MaRDI QIDQ1367032FDOQ1367032
Authors: Alexander Kelmans 
Publication date: 28 April 1998
Published in: Discrete Mathematics (Search for Journal in Brave)
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Graph theory
- Matching theory
- On the Complexity of General Graph Factor Problems
- Title not available (Why is that?)
- Packings by cliques and by finite families of graphs
- On factors with given components
- Title not available (Why is that?)
- An extension of matching theory
- On matroids induced by packing subgraphs
- An extension of Tutte's 1-factor theorem
- Efficient subgraphs packing
- Packings by Complete Bipartite Graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (15)
- Title not available (Why is that?)
- Linear-vertex kernel for the problem of packing \(r\)-stars into a graph without long induced paths
- Title not available (Why is that?)
- 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)
