Partial complementation of graphs
From MaRDI portal
Publication:5116485
DOI10.4230/LIPICS.SWAT.2018.21zbMATH Open1477.68225OpenAlexW2964088272MaRDI QIDQ5116485FDOQ5116485
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
Recommendations
Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Cites Work
- Title not available (Why is that?)
- Linear time solvable optimization problems on graphs of bounded clique-width
- Upper bounds to the clique width of graphs
- Title not available (Why is that?)
- Recent developments on graphs of bounded clique-width
- Rank-width and vertex-minors
- Vertex-minors, monadic second-order logic, and a conjecture by Seese
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- List Partitions
- Recognizing locally equivalent graphs
- Finding Branch-Decompositions and Rank-Decompositions
- Title not available (Why is that?)
- Graph-Theoretic Concepts in Computer Science
- Rank-width: algorithmic and structural results
- On Switching to H‐Free Graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the Hardness of Switching to a Small Number of Edges
Cited In (9)
- Title not available (Why is that?)
- Computational graph completion
- A survey of parameterized algorithms and the complexity of edge modification
- Title not available (Why is that?)
- The connected component of the partial duplication graph
- Graphs omitting sums of complete graphs
- The partial complement of graphs
- Complement of a graph: a generalization
- Subgraph complementation
This page was built for publication: Partial complementation of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5116485)