Algorithms for subgraph complementation to some classes of graphs (extended abstract)

DOI10.5817/CZ.MUNI.EUROCOMB23-006MaRDI QIDQ7000373zbMATH OpenFDO

Authors Dhanyamol Antony, Sagartanu Pal, R. B. Sandeep

Publication date 8 April 2025

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://doi.org/10.5817/CZ.MUNI.EUROCOMB23-006

zbMATH Keywords

polynomial-time algorithmsubgraph complementation

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25)

Cites work

• Cutting a tree with subgraph complementation is hard, except for some small trees
• Generalized split graphs and Ramsey numbers
• On subgraph complementation to \(H\)-free Graphs
• Parameterized algorithms
• Parameterized algorithms for deletion to (r,)-graphs
• Polynomial kernelization for removing induced claws and diamonds
• Recent developments on graphs of bounded clique-width
• Subgraph complementation

This page was built for publication: Algorithms for subgraph complementation to some classes of graphs (extended abstract)

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