On Switching to H‐Free Graphs

DOI10.1002/jgt.21745zbMath1292.05247OpenAlexW2098890646MaRDI QIDQ5417832

Jan Kratochvíl, Eva Jelínková

Publication date: 22 May 2014

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.21745

zbMATH Keywords

computational complexity\(H\)-free graphsSeidel's switching

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (6)

Subgraph complementation ⋮ On subgraph complementation to \(H\)-free graphs ⋮ Cutting a tree with subgraph complementation is hard, except for some small trees ⋮ On the Hardness of Switching to a Small Number of Edges ⋮ Partial complementation of graphs ⋮ On subgraph complementation to \(H\)-free Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Pancyclicity in switching classes
• Recognizing \(P_ 3\)-structure: A switching approach
• The bi-join decomposition
• A Characterization of Acyclic Switching Classes of Graphs Using Forbidden Subgraphs
• Circular permutation graphs
• A linear time algorithm to recognize circular permutation graphs
• Graph-Theoretic Concepts in Computer Science
• On perfect switching classes

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