Optimal packing of induced stars in a graph
From MaRDI portal
Publication:1367032
DOI10.1016/S0012-365X(96)00121-5zbMath0887.05041MaRDI QIDQ1367032
Publication date: 28 April 1998
Published in: Discrete Mathematics (Search for Journal in Brave)
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
Induced star partition of graphs ⋮ Graph factors and factorization: 1985--2003: a survey ⋮ Induced graph packing problems ⋮ Packing 3-vertex paths in claw-free graphs and related topics ⋮ On packing 3-vertex paths in a graph ⋮ Star covers and star partitions of double-split graphs ⋮ Packing $k$-Matchings and $k$-Critical Graphs ⋮ Packing in honeycomb networks
Cites Work
- On factors with given components
- An extension of matching theory
- Packings by cliques and by finite families of graphs
- Matching theory
- On matroids induced by packing subgraphs
- An extension of Tutte's 1-factor theorem
- Efficient subgraphs packing
- On the Complexity of General Graph Factor Problems
- Packings by Complete Bipartite Graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item