Jun 22, 2022 · We focus on subgraph complementation problems for \(\mathcal {G}\) being H-free graphs. For a graph H, in the problem Subgraph Complement to H- ...
Mar 4, 2021 · We investigate the complexity of the problem when \mathcal{G} is H-free for H being a complete graph, a star, a path, or a cycle. We obtain the ...
Sep 20, 2021 · We investigate the complexity of the problem when is H-free for H being a complete graph, a star, a path, or a cycle.
A simple complementation argument implies that results for are applicable for, thereby obtaining similar results for H being the complement of a complete graph, ...
Mar 4, 2021 · For a graph H, in the problem Subgraph Complement to H-free graphs (SC to H-free graphs), the task is to find whether there exists a subset S of ...
[PDF] On Subgraph Complementation to H-free Graphs - Semantic Scholar
www.semanticscholar.org › paper
On Subgraph Complementation to H-free Graphs · Dhanyamol Antony, Jay Garchar, +3 authors. R. Subashini · Published in Algorithmica 4 March 2021 · Mathematics.
Oct 1, 2022 · We investigate the complexity of the problem when G is H-free for H being a complete graph, a star, a path, or a cycle.
Citation: Antony, D, Garchar J, Pal S, Sandeep RB, Sen S, Subashini R. 2021. On subgraph complementation to H-free graphs, June 24.
Jan 23, 2019 · I see that having an induced subgraph is a stronger condition and is more in-line with what we might expect out of subgraphs.
Missing: complementation | Show results with:complementation
Sep 6, 2024 · We investigate the complexity of the problem when $\mathcal{G}$ is $H$-free for $H$ being a complete graph, a star, a path, or a cycle. We ...