Skip to Main content Skip to Navigation
Conference papers

Packing and Covering Immersion Models of Planar subcubic Graphs

Abstract : A graph H is an immersion of a graph G if H can be obtained by some subgraph G after lifting incident edges. We prove that there is a polynomial function f : N × N → N, such that if H is a connected planar subcubic graph on h > 0 edges, G is a graph, and k is a non-negative integer, then either G contains k vertex/edge-disjoint subgraphs, each containing H as an immersion, or G contains a set F of f (k, h) vertices/edges such that G \ F does not contain H as an immersion.
Document type :
Conference papers
Complete list of metadata

Cited literature [28 references]  Display  Hide  Download
Contributor : Dimitrios Thilikos <>
Submitted on : Thursday, September 22, 2016 - 1:00:46 PM
Last modification on : Monday, December 28, 2020 - 10:22:04 AM


Files produced by the author(s)



Archontia C. Giannopoulou, O-Joung Kwon, Jean-Florent Raymond, Dimitrios M. Thilikos. Packing and Covering Immersion Models of Planar subcubic Graphs. WG: Workshop on Graph-Theoretic Concepts in Computer Science, Jun 2016, İstanbul, Turkey. ⟨10.1016/j.ejc.2017.05.009⟩. ⟨lirmm-01370310v1⟩



Record views


Files downloads