On perfect switching classes
From MaRDI portal
Publication:5967036
DOI10.1016/S0166-218X(98)00153-XzbMath0930.05044OpenAlexW4213375415MaRDI QIDQ5967036
Publication date: 28 June 1999
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0166-218x(98)00153-x
Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15) Perfect graphs (05C17) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items
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 ⋮ On Switching to H‐Free Graphs
Cites Work