Abstract
Seidel’s switching of a vertex in a given graph results in making the vertex adjacent to precisely those vertices it was nonadjacent before, while keeping the rest of the graph unchanged. Two graphs are called switching equivalent if one can be transformed into the other one by a sequence of Seidel’s switchings. We consider the computational complexity of deciding if an input graph can be switched into a graph having a desired graph property. Among other results we show that switching to a regular graph is NP-complete. The proof is based on an NP-complete variant of hypergraph bicoloring that we find interesting in its own.
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
Colbourn, C.J., Corneil, D.G.: On deciding switching equivalence of graphs. Discrete Appl. Math. 2, 181–184 (1980)
Ehrenfeucht, A., Hage, J., Harju, T., Rozenberg, G.: Rozenberg: 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)
Gonzales, T.F.: Clustering to minimize the maximum intercluster distance. Theoret. Comput. Sci. 38, 293–306 (1985)
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. Discr. Appl. Math. 89, 263–267 (1998)
Hertz, A.: On perfect switching classes. Discr. Appl. Math. 94, 3–7 (1999)
Kratochvil, J.: Perfect codes and two-graphs. Comment. Math. Univ. Carolin. 30, 755–760 (1989)
Kratochvíl, J., Nešetřil, J., Zýka, O.: On the computational complexity of Seidel’s switching, Combinatorics, graphs and complexity. In: Proc. 4th Czech. Symp., Prachatice 1990, Ann. Discrete Math., vol. 51, pp. 161–166 (1992)
Kratochvil, J., Rosenfeld, M.: unpublished
Schaefer, T.J.: The complexity of satisfiability problems. In: Proc. of the Tenth Annual ACM Symposium on Theory of Computing (STOC), pp. 216–226 (1978)
Seidel, J.J.: A survey of two-graphs, Teorie combinatorie. Atti Conv. Lincei, Academia Nazionale dei Lincei, Rome 17, 481–511 (1973)
Seidel, J.J., Taylor, D.E.: Two-graphs, a second survey, Algebraic methods in graph theory, Vol. II, Conf. Szeged 1978. Colloq. Math. Janos Bolyai 25, 689–711 (1981)
Seidel, J.J.: More about two-graphs, Combinatorics, graphs and complexity. In: Proc. 4th Czech. Symp., Prachatice 1990. Ann. Discrete Math., vol. 51, pp. 297–308 (1992)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kratochvíl, J. (2003). Complexity of Hypergraph Coloring and Seidel’s Switching. In: Bodlaender, H.L. (eds) Graph-Theoretic Concepts in Computer Science. WG 2003. Lecture Notes in Computer Science, vol 2880. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39890-5_26
Download citation
DOI: https://doi.org/10.1007/978-3-540-39890-5_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20452-7
Online ISBN: 978-3-540-39890-5
eBook Packages: Springer Book Archive