A polynomial kernel for 3-leaf power deletion

Cites Work

Fundamentals of parameterized complexity
Fixed-parameter algorithms for cluster vertex deletion
The node-deletion problem for hereditary properties is NP-complete
Linear time solvable optimization problems on graphs of bounded clique-width
A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem
Parameterized Algorithms
Improved upper bounds for vertex cover
Distance-hereditary graphs
Decomposition of Directed Graphs
Faster Parameterized Algorithms Using Linear Programming
Some remarks about leaf roots
Error compensation in leaf power problems
On graph powers for leaf-labeled trees
The 3-Steiner Root Problem
Structure and linear-time recognition of 4-leaf powers
Structure and linear time recognition of 3-leaf powers
A kernel of order \(2k-c\log k\) for vertex cover
Parameterized complexity of vertex deletion into perfect graph classes
The 4-Steiner Root problem
Parameterized leaf power recognition via embedding into graph products
Approximation and Kernelization for Chordal Vertex Deletion
Feedback Vertex Set Inspired Kernel for Chordal Vertex Deletion
Kernelization
Title not available (Why is that?)
The NLC-width and clique-width for powers of graphs of bounded tree-width
A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletion
A polynomial kernel for block graph deletion
Interval Vertex Deletion Admits a Polynomial Kernel
A polynomial kernel for distance-hereditary vertex deletion
Subquadratic Kernels for Implicit 3-H <scp>itting</scp> S <scp>et</scp> and 3-S <scp>et</scp> P <scp>acking</scp> Problems

Cited In (1)

Structure and linear time recognition of 3-leaf powers

This page was built for publication: A polynomial kernel for 3-leaf power deletion

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6046945)