Abstract
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 H having at most three vertices or isomorphic to P 4. We show that for H isomorphic to a claw, the problem is polynomial, too. Further, we give a characterization of graphs switching-equivalent to a K 1,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.
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 classes. 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, New York (1979)
Hage, J., Harju, T.: A characterization of acyclic switching classes of graphs using forbidden subgraphs. SIAM J. Discrete Math. 18, 159–176 (2004)
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)
Herman, J.: Computational Complexity in Graph Theory, master thesis, Charles University in Prague (2006)
Hertz, A.: On perfect switching classes. Discrete Appl. Math. 94, 3–7 (1999)
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., vol. 51, pp. 161–166 (1992)
Kratochvíl, J.: Perfect codes and two-graphs. Comment. Math. Univ. Carolin. 30, 755–760 (1989)
Kratochvíl, J.: Complexity of hypergraph coloring and Seidel’s switching. In: Bodlaender, H.L. (ed.) WG 2003. LNCS, vol. 2880, pp. 297–308. Springer, Heidelberg (2003)
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. In: 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. In: Algebraic methods in graph theory, vol. II, Conf. Szeged 1978, Colloq. Math. Janos Bolyai, vol. 25, pp. 689–711 (1981)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jelínková, E., Kratochvíl, J. (2008). On Switching to H-Free Graphs. In: Ehrig, H., Heckel, R., Rozenberg, G., Taentzer, G. (eds) Graph Transformations. ICGT 2008. Lecture Notes in Computer Science, vol 5214. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-87405-8_26
Download citation
DOI: https://doi.org/10.1007/978-3-540-87405-8_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-87404-1
Online ISBN: 978-3-540-87405-8
eBook Packages: Computer ScienceComputer Science (R0)