Recognizing \(P_ 3\)-structure: A switching approach
From MaRDI portal
Publication:1924124
DOI10.1006/jctb.1996.0018zbMath0858.05092OpenAlexW2066226160MaRDI QIDQ1924124
Publication date: 11 March 1997
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jctb.1996.0018
Hypergraphs (05C65) Structural characterization of families of graphs (05C75) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (7)
Cutting a tree with subgraph complementation is hard, except for some small trees ⋮ Algorithmic aspects of switch cographs ⋮ Switching to Hedgehog-Free Graphs Is NP-Complete ⋮ The behavior of clique-width under graph operations and graph transformations ⋮ On Switching to H‐Free Graphs ⋮ On perfect switching classes ⋮ On perfect switching classes
This page was built for publication: Recognizing \(P_ 3\)-structure: A switching approach
