A \(5k\)-vertex kernel for \(P_2\)-packing
From MaRDI portal
Publication:2118855
DOI10.1016/j.tcs.2022.01.032OpenAlexW2796325722MaRDI QIDQ2118855
Wenjun Li, Junjie Ye, Yixin Cao
Publication date: 23 March 2022
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2022.01.032
Cites Work
- Packing 3-vertex paths in claw-free graphs and related topics
- Looking at the stars
- An improved kernelization for \(P_{2}\)-packing
- Maximum bounded \(H\)-matching is Max SNP-complete
- Kernels for packing and covering problems
- The path partition problem and related problems in bipartite graphs
- On packing 3-vertex paths in a graph
- Kernelization and Parameterized Algorithms for 3-Path Vertex Cover
- On the Complexity of General Graph Factor Problems
- How many disjoint 2-edge paths must a cubic graph have?
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- Graph-Theoretic Concepts in Computer Science
This page was built for publication: A \(5k\)-vertex kernel for \(P_2\)-packing
