Switching to hedgehog-free graphs is NP-complete

Authors:
Eva Jelínková
Affiliations:
Department of Applied Mathematics, Charles University, Praha, Czech Republic
Venue:
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
Year:
2011

Citing 7
Cited 0

Recognizing P3-structure: a switching approach

Journal of Combinatorial Theory Series B
On perfect switching classes

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
On Switching to H-Free Graphs

ICGT '08 Proceedings of the 4th international conference on Graph Transformations

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study the problem of deciding if, for a fixed graph H, a given graph is switching-equivalent to an H-free graph. In all cases of H that have been solved so far, the problem is decidable in polynomial time. We give infinitely many graphs H such that the problem is NP-complete, thus solving an open problem [Kratochvíl, Nešetřil and Zýka, Ann. Discrete Math. 51 (1992)].