Partial complementation of graphs

DOI10.4230/LIPIcs.SWAT.2018.21zbMath1477.68225OpenAlexW2964088272MaRDI QIDQ5116485

Torstein J. F. Strømme, Petr A. Golovach, Fedor V. Fomin, Dimitrios M. Thilikos

Publication date: 25 August 2020

Full work available at URL: https://doi.org/10.4230/LIPIcs.SWAT.2018.21

zbMATH Keywords

graph classesgraph editingpartial complementation

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (2)

Subgraph complementation ⋮ A survey of parameterized algorithms and the complexity of edge modification

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Recognizing locally equivalent graphs
• Vertex-minors, monadic second-order logic, and a conjecture by Seese
• Recent developments on graphs of bounded clique-width
• Linear time solvable optimization problems on graphs of bounded clique-width
• Upper bounds to the clique width of graphs
• Rank-width: algorithmic and structural results
• Rank-width and vertex-minors
• On the Hardness of Switching to a Small Number of Edges
• List Partitions
• On Switching to H‐Free Graphs
• Finding Branch-Decompositions and Rank-Decompositions
• Graph-Theoretic Concepts in Computer Science

This page was built for publication: Partial complementation of graphs