English

The Structure of $W_4$-Immersion-Free Graphs

Combinatorics 2016-02-08 v1

Abstract

We study the structure of graphs that do not contain the wheel on 5 vertices W4 as an immersion, and show that these graphs can be constructed via 1, 2, and 3-edge-sums from subcubic graphs and graphs of bounded treewidth.

Keywords

Cite

@article{arxiv.1602.02002,
  title  = {The Structure of $W_4$-Immersion-Free Graphs},
  author = {Rémy Belmonte and Archontia Giannopoulou and Daniel Lokshtanov and Dimitrios M. Thilikos},
  journal= {arXiv preprint arXiv:1602.02002},
  year   = {2016}
}

Comments

Presented in ICGT 2014

R2 v1 2026-06-22T12:44:13.694Z