On subgraph complementation to \(H\)-free graphs
From MaRDI portal
Publication:2672430
DOI10.1007/978-3-030-86838-3_9OpenAlexW3202671266MaRDI QIDQ2672430
Dhanyamol Antony, R. B. Sandeep, R. Subashini, Jay Garchar, Sagartanu Pal, Sagnik Sen
Publication date: 8 June 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-86838-3_9
Related Items (2)
Cutting a tree with subgraph complementation is hard, except for some small trees ⋮ On subgraph complementation to \(H\)-free Graphs
Cites Work
- Recent developments on graphs of bounded clique-width
- A more effective linear kernelization for cluster editing
- Generalized split graphs and Ramsey numbers
- Cluster editing: kernelization based on edge cuts
- On the (non-)existence of polynomial kernels for \(P _{l }\)-free edge modification problems
- Incompressibility of \(H\)-free edge modification problems: towards a dichotomy
- Subgraph complementation
- Incompressibility of \(H\)-free edge modification problems
- Edge-Deletion Problems
- Dichotomy Results on the Hardness of $H$-free Edge Modification Problems
- On Switching to H‐Free Graphs
- Parameterized Algorithms
- Polynomial kernels for paw-free edge modification problems
- Unnamed Item
- Unnamed Item
This page was built for publication: On subgraph complementation to \(H\)-free graphs
