{
  "id": "1602.04042",
  "version": "v1",
  "published": "2016-02-12T13:14:08.000Z",
  "updated": "2016-02-12T13:14:08.000Z",
  "title": "Packing and Covering Immersion Models of Planar subcubic Graphs",
  "authors": [
    "Archontia Giannopoulou",
    "O-joung Kwon",
    "Jean-Florent Raymond",
    "Dimitrios M. Thilikos"
  ],
  "categories": [
    "math.CO"
  ],
  "abstract": "A graph $H$ is an immersion of a graph $G$ if $H$ can be obtained by some sugraph $G$ after lifting incident edges. We prove that there is a polynomial function $f:\\Bbb{N}\\times\\Bbb{N}\\rightarrow\\Bbb{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\\setminus F$ does not contain $H$ as an immersion.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2016-02-12T13:14:08.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05C75",
      "G.2.2"
    ],
    "keywords": [
      "covering immersion models",
      "connected planar subcubic graph",
      "lifting incident edges",
      "vertex/edge-disjoint subgraphs",
      "polynomial function"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2016arXiv160204042G"
    }
  }
}