Years and Authors of Summarized Original Work
2011; Grohe, Kawarabayashi, Marx, Wollan
Problem Definition
To subdivide an edge e in a graph G with endpoints u and v, delete the edge from the graph and add a path of length two connecting the vertices u and v. A graph G is a subdivision of graph H if G can be obtained from H by repeatedly subdividing edges. A graph H is a topological subgraph (or topological minor) of graph G if a subdivision of H is a subgraph of G. Equivalently, H is a topological subgraph of G if H can be obtained from G by deleting edges, deleting vertices, and suppressing vertices of degree 2 (to suppress a vertex of degree 2, delete the vertex and add an edge connecting its two neighbors). The notion of topological subgraphs appears in the classical result of Kuratowski in 1935 stating that a graph is planar if and only if it does not have a topological subgraph isomorphic to K5 or K3, 3. This entry considers the problem of determining, given a graph G and H,...
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
Recommended Reading
Bodlaender H (2006) Treewidth: characterizations, applications, and computations. In: Graph-theoretic concepts in computer science. Lecture notes in computer science, vol 4271. Springer, Berlin/Heidelberg, pp 1–14
Bodlaender H, Koster A (2008) Combinatorial optimization on graphs of bounded treewidth. Comput J 51(3): 255–269
Courcelle B (1990) The monadic second-order logic of graphs I: Recognizable sets of finite graphs. Info Comput 85:12–75
Downey RG, Fellows MR (1992) Fixed-parameter intractability. In: Proceedings of the seventh annual structure in complexity theory conference, Boston, npp 36–49
Downey RG, Fellows MR (1999) Parameterized complexity. Monographs in computer science. Springer, New York
Fortune S, Hopcroft JE, Wyllie J (1980) The directed subgraph homeomorphism problem. Theor Comput Sci 10:111–121
Garey MR, Johnson DS (1979) Computers and intractability. W.H. Freeman, San Francisco
Grohe M, Kawarabayashi K, Marx D, Wollan P (2011) Finding topological subgraphs is fixed parameter tractable. In: STOC’11 proceedings of the 43rd ACM symposium on theory of computing, San Jose, pp 479–488
Grohe M, Marx D (2012) Structure theorem and isomorphism test for graphs with excluded topological subgraphs. In: STOC ’12 proceedings of the forty-fourth annual ACM symposium on theory of computing, New York, p 173–192
Kawarabayashi K, Wollan P (2011) A shorter proof of the graph minor algorithm: the unique linkage theorem. In: STOC’10 proceedings of the 42rd ACM symposium on theory of computing, Cambridge, pp 687–694
Kawarabayashi K, Thomas R, Wollan P(2013) A new proof of the flat wall theorem. http://arxiv.org/abs/1207.6927
LaPaugh AS, Rivest RL (1980) The subgraph homeomorphism problem. J Comput Syst Sci 20(2):133–149
Robertson N, Seymour PD (1995) Graph minors XIII: the disjoint paths problem. J Combin Theory Ser B 63:65–110
Robertson N, Seymour PD (2010) Graph minors XXIII: Nash Williams’ immersion conjecture. J Combin Theory Ser B 100(2):181–205
Scheffler P (1989) Linear time algorithms for graphs of bounded tree-width: the disjoint paths problem. Dresdner Reihe Forschung 5(9):49–52
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer Science+Business Media New York
About this entry
Cite this entry
Wollan, P. (2016). Finding Topological Subgraphs. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, New York, NY. https://doi.org/10.1007/978-1-4939-2864-4_695
Download citation
DOI: https://doi.org/10.1007/978-1-4939-2864-4_695
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4939-2863-7
Online ISBN: 978-1-4939-2864-4
eBook Packages: Computer ScienceReference Module Computer Science and Engineering