Excluding Graphs as Immersions in Surface Embedded Graphs

Abstract : We prove a structural characterization of graphs that forbid a fixed graph H as an immersion and can be embedded in a surface of Euler genus γ. In particular, we prove that a graph G that excludes some connected graph H as an immersion and is embedded in a surface of Euler genus γ has either “small” treewidth (bounded by a function of H and γ) or “small” edge connectivity (bounded by the maximum degree of H). Using the same techniques we also prove an excluded grid theorem on bounded genus graphs for the immersion relation.
Complete list of metadatas

https://hal-lirmm.ccsd.cnrs.fr/lirmm-01483644
Contributor : Dimitrios M. Thilikos <>
Submitted on : Monday, March 6, 2017 - 11:35:21 AM
Last modification on : Thursday, November 15, 2018 - 3:40:22 PM

Links full text

Identifiers

Collections

Citation

Archontia C. Giannopoulou, Marcin Kamiński, Dimitrios M. Thilikos. Excluding Graphs as Immersions in Surface Embedded Graphs. WG: Workshop on Graph-Theoretic Concepts in Computer Science, Jun 2013, Lübeck, Germany. pp.274-285, ⟨10.1007/978-3-642-45043-3_24⟩. ⟨lirmm-01483644⟩

Share

Metrics

Record views

124