On Switching to H-Free Graphs

DOI10.1007/978-3-540-87405-8_26zbMATH Open1175.68298OpenAlexW1685464434MaRDI QIDQ3540412FDOQ3540412

Authors: Eva Jelínková, Jan Kratochvíl 

Publication date: 20 November 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-87405-8_26

Recommendations

• On Switching to H‐Free Graphs
• Switching to hedgehog-free graphs is NP-complete
• scientific article; zbMATH DE number 475587
• Choosability on \(H\)-free graphs
• On subgraph complementation to \(H\)-free graphs
• On subgraph complementation to \(H\)-free Graphs
• \(H\)-free graphs of large minimum degree
• On switching classes of graphs
• Graph isomorphism for \((H_1,H_2)\)-free graphs: an almost complete dichotomy
• Graph isomorphism for \((H_1, H_2)\)-free graphs: an almost complete dichotomy

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Grammars and rewriting systems (68Q42)

Cited In (4)

• Graph isomorphism for \((H_1, H_2)\)-free graphs: an almost complete dichotomy
• Switching to hedgehog-free graphs is NP-complete
• Algorithmic aspects of switch cographs
• On Switching to H‐Free Graphs

This page was built for publication: On Switching to H-Free Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3540412)