The maximum 3-star packing problem in claw-free cubic graphs
From MaRDI portal
Publication:6645157
DOI10.1007/s10878-024-01115-zMaRDI QIDQ6645157
Publication date: 28 November 2024
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Linear-vertex kernel for the problem of packing \(r\)-stars into a graph without long induced paths
- A simplified NP-complete MAXSAT problem
- Packing 3-vertex paths in claw-free graphs and related topics
- Tighter bounds on the size of a maximum \(P_{3}\)-matching in a cubic graph
- Packings by cliques and by finite families of graphs
- Efficient subgraphs packing
- On maximum \(P_3\)-packing in claw-free subcubic graphs
- Packing bipartite graphs with covers of complete bipartite graphs
- The path partition problem and related problems in bipartite graphs
- On packing 3-vertex paths in a graph
- Odd cycle packing
- Approximability of the Distance Independent Set Problem on Regular Graphs and Planar Graphs
- Approximation Algorithm for the Distance-3 Independent Set Problem on Cubic Graphs
- On the Complexity of General Graph Factor Problems
- On the Size of Systems of Sets Every t of which Have an SDR, with an Application to the Worst-Case Ratio of Heuristics for Packing Problems
- Packings by Complete Bipartite Graphs
- How many disjoint 2-edge paths must a cubic graph have?
- The k‐piece packing problem
- Parallel Processing and Applied Mathematics
- Approximation algorithms and hardness results for the clique packing problem
This page was built for publication: The maximum 3-star packing problem in claw-free cubic graphs
