Abstract
We study the complexity of the Graph Isomorphism problem on graph classes that are characterized by a finite number of forbidden induced subgraphs, focusing mostly on the case of two forbidden subgraphs. We show hardness results and develop techniques for the structural analysis of such graph classes, which applied to the case of two forbidden subgraphs give the following results: A dichotomy into isomorphism complete and polynomial-time solvable graph classes for all but finitely many cases, whenever neither of the forbidden graphs is a clique, a pan, or a complement of these graphs. Further reducing the remaining open cases we show that (with respect to graph isomorphism) forbidding a pan is equivalent to forbidding a clique of size three.
In this version some proofs are omitted. For these the reader is referred to [12].
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Babai, L., Luks, E.M.: Canonical labeling of graphs. In: STOC 1983, pp. 171–183 (1983)
Babel, L., Ponomarenko, I.N., Tinhofer, G.: The isomorphism problem for directed path graphs and for rooted directed path graphs. Journal of Algorithms 21(3), 542–564 (1996)
Beineke, L.W.: Characterizations of derived graphs. Journal of Combinatorial Theory, Series B 9(2), 129–135 (1970)
Booth, K.S., Colbourn, C.J.: Problems polynomially equivalent to graph isomorphism. Technical Report CS-77-04, Comp. Sci. Dep., Univ. Waterloo (1979)
Boppana, R.B., Hastad, J., Zachos, S.: Does co-NP have short interactive proofs? Information Processing Letters 25, 127–132 (1987)
Brandstädt, A., Dragan, F.F., Le, H., Mosca, R.: New graph classes of bounded clique-width. Theory of Computing Systems 38, 623–645 (2005)
Corneil, D.G., Lerchs, H., Stewart Burlingham, L.: Complement reducible graphs. Discrete Applied Mathematics 3(3), 163–174 (1981)
Grohe, M., Marx, D.: Structure theorem and isomorphism test for graphs with excluded topological subgraphs. In: STOC, pp. 173–192 (2012)
Hsu, W.L.: O(m·n) algorithms for the recognition and isomorphism problems on circular-arc graphs. SIAM Journal on Computing 24(3), 411–439 (1995)
Köbler, J., Schöning, U., Torán, J.: The graph isomorphism problem: its structural complexity. Birkhäuser Verlag, Basel (1993)
Král, D., Kratochvíl, J., Tuza, Z., Woeginger, G.J.: Complexity of Coloring Graphs without Forbidden Induced Subgraphs. In: Brandstädt, A., Van Le, B. (eds.) WG 2001. LNCS, vol. 2204, pp. 254–262. Springer, Heidelberg (2001)
Kratsch, S., Schweitzer, P.: Full version of paper. arXiv:1208.0142 [cs.DS]
Kratsch, S., Schweitzer, P.: Isomorphism for Graphs of Bounded Feedback Vertex Set Number. In: Kaplan, H. (ed.) SWAT 2010. LNCS, vol. 6139, pp. 81–92. Springer, Heidelberg (2010)
Lozin, V.V.: A decidability result for the dominating set problem. Theoretical Computer Science 411(44–46), 4023–4027 (2010)
Lueker, G.S., Booth, K.S.: A linear time algorithm for deciding interval graph isomorphism. Journal of the ACM 26(2), 183–195 (1979)
Luks, E.M.: Isomorphism of graphs of bounded valence can be tested in polynomial time. Journal of Computer and System Sciences 25(1), 42–65 (1982)
Nakano, S., Uehara, R., Uno, T.: A new approach to graph recognition and applications to distance-hereditary graphs. Journal of Computer Science and Technology 24, 517–533 (2009)
Ponomarenko, I.N.: The isomorphism problem for classes of graphs closed under contraction. Journal of Mathematical Sciences 55(2), 1621–1643 (1991)
Ramsey, F.P.: On a problem of formal logic. Proceedings of the London Mathematical Society s2-30(1), 264–286 (1930)
Rao, M.: Decomposition of (gem,co-gem)-free graphs (unpublished), http://www.labri.fr/perso/rao/publi/decompgemcogem.ps
Schöning, U.: Graph isomorphism is in the low hierarchy. Journal of Computer and System Sciences 37(3), 312–323 (1988)
Schweitzer, P.: Problems of unknown complexity: Graph isomorphism and Ramsey theoretic numbers. PhD thesis, Universität des Saarlandes, Germany (2009)
Uehara, R., Toda, S., Nagoya, T.: Graph isomorphism completeness for chordal bipartite graphs and strongly chordal graphs. Discrete Applied Mathematics 145(3), 479–482 (2005)
Whitney, H.: Congruent graphs and the connectivity of graphs. American Journal of Mathematics 54(1), 150–168 (1932)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kratsch, S., Schweitzer, P. (2012). Graph Isomorphism for Graph Classes Characterized by Two Forbidden Induced Subgraphs. In: Golumbic, M.C., Stern, M., Levy, A., Morgenstern, G. (eds) Graph-Theoretic Concepts in Computer Science. WG 2012. Lecture Notes in Computer Science, vol 7551. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-34611-8_7
Download citation
DOI: https://doi.org/10.1007/978-3-642-34611-8_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-34610-1
Online ISBN: 978-3-642-34611-8
eBook Packages: Computer ScienceComputer Science (R0)