On maximum \(P_3\)-packing in claw-free subcubic graphs
From MaRDI portal
Publication:2025062
DOI10.1007/s10878-021-00708-2zbMath1464.05310OpenAlexW3126482586MaRDI QIDQ2025062
Publication date: 11 May 2021
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-021-00708-2
Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- An \(O^*(1.4366^n)\)-time exact algorithm for maximum \(P_2\)-packing in cubic graphs
- Matching and weighted \(P_2\)-packing: algorithms and kernels
- Packing 3-vertex paths in claw-free graphs and related topics
- Looking at the stars
- A parameterized perspective on packing paths of length two
- An improved kernelization for \(P_{2}\)-packing
- Tighter bounds on the size of a maximum \(P_{3}\)-matching in a cubic graph
- Packings by cliques and by finite families of graphs
- A new self-stabilizing algorithm for maximal \(p\)-star decomposition of general graphs
- Randomized parameterized algorithms for \(P_2\)-packing and co-path packing problems
- The path partition problem and related problems in bipartite graphs
- On packing 3-vertex paths in a graph
- 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
- Packingk-edge trees in graphs of restricted vertex degrees
- Factors and factorizations of graphs—a survey
- Packings by Complete Bipartite Graphs
- Planar 3DM is NP-complete
- How many disjoint 2-edge paths must a cubic graph have?
- Parallel Processing and Applied Mathematics
This page was built for publication: On maximum \(P_3\)-packing in claw-free subcubic graphs
