Structure of W_4 -immersion free graphs

Rémy Belmonte (1) , Archontia C. Giannopoulou (2) , Daniel Lokshtanov (3) , Dimitrios M. Thilikos (4, 5)

1 UiB - University of Bergen
2 Department of Computer Science
3 UiB - Department of Informatics [Bergen]
4 Department of Mathematics [Athens]
5 ALGCO - Algorithmes, Graphes et Combinatoire

We study the structure of graphs that do not contain the wheel on 5 vertices W 4 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.

Domaines: Mathématique discrète [cs.DM]

Rémy Belmonte, Archontia C. Giannopoulou, Daniel Lokshtanov, Dimitrios M. Thilikos. Structure of W_4 -immersion free graphs. ICGT: International Colloquium on Graph Theory and combinatorics, Jun 2014, Grenoble, France. ⟨hal-01084005⟩