Recognizing P3-structure: a switching approach
Journal of Combinatorial Theory Series B
Proceedings of the third international conference on Graphs and optimization
Pancyclicity in switching classes
Information Processing Letters
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Complexity Issues in Switching of Graphs
TAGT'98 Selected papers from the 6th International Workshop on Theory and Application of Graph Transformations
Euler Graphs, Triangle-Free Graphs and Bipartite Graphs in Switching Classes
ICGT '02 Proceedings of the First International Conference on Graph Transformation
A Characterization of Acyclic Switching Classes of Graphs Using Forbidden Subgraphs
SIAM Journal on Discrete Mathematics
Switching to hedgehog-free graphs is NP-complete
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
| Hi-index | 0.00 |
In this paper we study the problem of deciding if, for a fixed graph H, a given graph is switching-equivalent to an H-free graph. Polynomial-time algorithms are known for Hhaving at most three vertices or isomorphic to P4. We show that for Hisomorphic to a claw, the problem is polynomial, too. Further, we give a characterization of graphs switching-equivalent to a K1,2-free graph by ten forbidden induced subgraphs, each having five vertices. We also give the forbidden induced subgraphs for graphs switching-equivalent to a forest of bounded vertex degrees.