A 5k-vertex kernel for P₂-packing
From MaRDI portal
Publication:2118855
Recommendations
- An improved kernelization for \(P_{2}\)-packing
- Packing of \(K_{v}\) with certain graphs of five vertices
- scientific article; zbMATH DE number 2114468
- Kernelization for \(P_2\)-packing: a gerrymandering approach
- A Problem Kernelization for Graph Packing
- Kernels for Packing and Covering Problems
- A note to maximum packings of K_v with a graph G of five vertices and five edges
- An improved kernel for planar vertex-disjoint triangle packing
- A \(5k\)-vertex kernel for 3-path vertex cover
- Planar vertex-disjoint cycle packing: new structures and improved kernel
Cites work
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- An improved kernelization for \(P_{2}\)-packing
- Graph-Theoretic Concepts in Computer Science
- How many disjoint 2-edge paths must a cubic graph have?
- Kernelization and Parameterized Algorithms for 3-Path Vertex Cover
- Kernels for packing and covering problems
- Looking at the stars
- Maximum bounded \(H\)-matching is Max SNP-complete
- On packing 3-vertex paths in a graph
- On the Complexity of General Graph Factor Problems
- Packing 3-vertex paths in claw-free graphs and related topics
- The path partition problem and related problems in bipartite graphs
Cited in
(3)
This page was built for publication: A \(5k\)-vertex kernel for \(P_2\)-packing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2118855)
