Cites work
- scientific article; zbMATH DE number 3290993 (Why is no real title available?)
- A dynamic algorithm for line graph recognition
- Algorithme de recherche d'un stable de cardinalité maximum dans un graphe sans étoilé
- Characterizations of derived graphs
- Claw-free graphs. IV: Decomposition theorem
- Congruent Graphs and the Connectivity of Graphs
- Dichotomy results on the hardness of H-free edge modification problems
- Edge-Deletion Problems
- Fixed-parameter tractability of graph modification problems for hereditary properties
- Fundamentals of parameterized complexity
- Incompressibility of \(H\)-free edge modification problems
- Intersection Theorems for Systems of Sets
- On the (non-)existence of polynomial kernels for \(P _{l }\)-free edge modification problems
- On the complexity of k-SAT
- Parameterized algorithms
- Parametrized complexity theory.
- Polynomial kernelization for removing induced claws and diamonds
- The complexity of some edge deletion problems
- The node-deletion problem for hereditary properties is NP-complete
- Two edge modification problems without polynomial kernels
Cited in
(8)- Linear Kernels for Edge Deletion Problems to Immersion-Closed Graph Classes
- A survey of parameterized algorithms and the complexity of edge modification
- A polynomial kernel for distance-hereditary vertex deletion
- A Polynomial Kernel for Proper Interval Vertex Deletion
- Polynomial Kernel for Interval Vertex Deletion
- Polynomial kernelization for removing induced claws and diamonds
- Kernel for proper Helly circular-arc vertex deletion: smaller and simpler via graph isomorphism
- A polynomial kernel for block graph deletion
This page was built for publication: A Polynomial Kernel for Line Graph Deletion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5874512)
