TY - JOUR

T1 - Packing and covering immersion-expansions of planar sub-cubic graphs

AU - Giannopoulou, Archontia C C.

AU - Kwon, O. joung

AU - Raymond, Jean Florent

AU - Thilikos, Dimitrios M M.

N1 - Publisher Copyright:
© 2017 Elsevier Ltd

PY - 2017/10

Y1 - 2017/10

N2 - 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 sub-cubic 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.

AB - 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 sub-cubic 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.

UR - http://www.scopus.com/inward/record.url?scp=85021232979&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85021232979&partnerID=8YFLogxK

U2 - 10.1016/j.ejc.2017.05.009

DO - 10.1016/j.ejc.2017.05.009

M3 - Article

AN - SCOPUS:85021232979

SN - 0195-6698

VL - 65

SP - 154

EP - 167

JO - European Journal of Combinatorics

JF - European Journal of Combinatorics

ER -