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)].
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ehrenfeucht, A., Hage, J., Harju, T., Rozenberg, G.: Pancyclicity in switching classes. Inform. Process. Letters 73, 153–156 (2000)
Ehrenfeucht, A., Hage, J., Harju, T., Rozenberg, G.: Complexity issues in switching of graphs. In: Ehrig, H., Engels, G., Kreowski, H.-J., Rozenberg, G. (eds.) TAGT 1998. LNCS, vol. 1764, pp. 59–70. Springer, Heidelberg (2000)
Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, New York (1979)
Hage, J., Harju, T., Welzl, E.: Euler graphs, triangle-free graphs and bipartite graphs in switching classes. In: Corradini, A., Ehrig, H., Kreowski, H.-J., Rozenberg, G. (eds.) ICGT 2002. LNCS, vol. 2505, pp. 148–160. Springer, Heidelberg (2002)
Hayward, R.B.: Recognizing P 3-structure: A switching approach. J. Combin. Th. Ser. B 66, 247–262 (1996)
Hertz, A.: On perfect switching classes. Discrete Appl. Math. 94, 3–7 (1999)
Jelínková, E., Kratochvíl, J.: On Switching to H-Free Graphs. In: Ehrig, H., Heckel, R., Rozenberg, G., Taentzer, G. (eds.) ICGT 2008. LNCS, vol. 5214, pp. 379–395. Springer, Heidelberg (2008)
Kratochvíl, J., Nešetřil, J., Zýka, O.: On the computational complexity of Seidel’s switching. In: Proc. 4th Czech. Symp., Prachatice (1990); Ann. Discrete Math. 51, 161–166 (1992)
Kratochvíl, J.: Complexity of hypergraph coloring and Seidel’s switching. In: Bodlaender, H. (ed.) WG 2003. LNCS, vol. 2880, pp. 297–308. Springer, Heidelberg (2003)
De Montgolfier, F., Rao, M.: The bi-join decomposition. Electronic Notes in Discrete Mathematics 22, 173–177 (2005)
Rotem, D., Urrutia, J.: Circular permutation graphs. Networks 12, 429–437 (1982)
Seidel, J.J.: Graphs and two-graphs. In: Proc. 5th. Southeastern Conf. on Combinatorics, Graph Theory, and Computing, Winnipeg, Canada (1974)
Seidel, J.J.: A survey of two-graphs. Teorie combinatorie, Atti Conv. Lincei, vol. 17, pp. 481–511. Academia Nazionale dei Lincei, Rome (1973)
Seidel, J.J., Taylor, D.E.: Two-graphs, a second survey. Algebraic Methods in Graph Theory, Conf. Szeged, vol. II (1978); Colloq. Math. Janos Bolyai 25, 689–711 (1981)
Sritharan, R.: A linear time algorithm to recognize circular permutation graphs. Networks 27, 171–174 (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jelínková, E. (2011). Switching to Hedgehog-Free Graphs Is NP-Complete. In: Ogihara, M., Tarui, J. (eds) Theory and Applications of Models of Computation. TAMC 2011. Lecture Notes in Computer Science, vol 6648. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-20877-5_45
Download citation
DOI: https://doi.org/10.1007/978-3-642-20877-5_45
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-20876-8
Online ISBN: 978-3-642-20877-5
eBook Packages: Computer ScienceComputer Science (R0)