Abstract
A graph G contains a multigraph H as an induced immersion if H can be obtained from G by a sequence of vertex deletions and lifts. We present a polynomial-time algorithm that decides for any fixed multigraph H whether an input graph G contains H as an induced immersion. We also show that for every multigraph H with maximum degree at most 2, there exists a constant c H such that every graph with treewidth more than c H contains H as an induced immersion.
This work is supported by the Research Council of Norway (197548/F20).
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
DeVos, M., Dvořák, Z., Fox, J., McDonald, J., Mohar, B., Scheide, D.: Minimum degree condition forcing complete graph immersion (submitted for publication)
DeVos, M., Kawarabayashi, K., Mohar, B., Okamura, H.: Immersing small complete graphs. Ars Math. Contemp. 3, 139–146 (2010)
Diestel, R.: Graph Theory. Electronic edn. Springer (2005)
Downey, R.G., Fellows, M.R.: Fixed-parameter intractability. In: Structure in Complexity Theory Conference, pp. 36–49 (1992)
Downey, R.G., Fellows, R.: Parameterized Complexity. Monographs in Computer Science. Springer (1999)
Fellows, M.R., Hermelin, D., Rosamond, F.A.: Well quasi orders in subclasses of bounded treewidth graphs and their algorithmic applications. Algorithmica 64, 3–18 (2012)
Fellows, M.R., Kratochvíl, J., Middendorf, M., Pfeiffer, F.: The complexity of induced minors and related problems. Algorithmica 13, 266–282 (1995)
Fellows, M.R., Langston, M.A.: On well-partial-order theory and its application to combinatorial problems of VLSI design. SIAM J. Disc. Math. 5(1), 117–126 (1992)
Ferrara, M., Gould, R., Tansey, G., Whalen, T.: On H-immersions. J. Graph Theory 57, 245–254 (2008)
Garey, M.R., Johnson, D.S., Tarjan, R.E.: The planar Hamiltonian circuit problem is NP-complete. SIAM J. Computing 5(4), 704–714 (1976)
Giannopoulou, A., Kamiński, M., Thilikos, D.M.: Forbidding Kuratowski graphs as immersions (manuscript)
Grohe, M., Kawarabayashi, K., Marx, D., Wollan, P.: Finding topological sugraphs is fixed-parameter tractable. In: STOC 2011, pp. 479–488. ACM (2011)
Grohe, M., Marx, D.: Structure theorem and isomorphism test for graphs with excluded topological subgraphs. In: STOC 2012, pp. 173–192. ACM (2012)
Kawarabayashi, K., Kobayashi, Y., Reed, B.: The disjoint paths problem in quadratic time. J. Comb. Theory, Ser. B 102, 424–435 (2012)
Lévêque, B., Lin, D.Y., Maffray, F., Trotignon, N.: Detecting induced subgraphs. Discrete Applied Math. 157(17), 3540–3551 (2009)
Robertson, N., Seymour, P.D.: Graph minors XIII: The disjoint paths problem. J. Comb. Theory, Ser. B 63(1), 65–110 (1995)
Robertson, N., Seymour, P.D.: Graph minors XX: Wagner’s conjecture. J. Comb. Theory, Ser. B 92(2), 325–357 (2004)
Robertson, N., Seymour, P.D.: Graph Minors XXIII: Nash-Williams’ immersion conjecture. J. Comb. Theory, Ser. B 100(2), 181–205 (2010)
Robertson, N., Seymour, P.D., Thomas, R.: Quickly excluding a planar graph. J. Comb. Theory, Ser. B 62(2), 323–348 (1994)
Seymour, P.D., Wollan, P.: The structure of graphs not admitting a fixed immersion (manuscript)
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
Belmonte, R., van ’t Hof, P., Kamiński, M. (2012). Induced Immersions. In: Chao, KM., Hsu, Ts., Lee, DT. (eds) Algorithms and Computation. ISAAC 2012. Lecture Notes in Computer Science, vol 7676. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-35261-4_33
Download citation
DOI: https://doi.org/10.1007/978-3-642-35261-4_33
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-35260-7
Online ISBN: 978-3-642-35261-4
eBook Packages: Computer ScienceComputer Science (R0)