The Structure of $W_4$-Immersion-Free Graphs

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.

Presented in ICGT 2014

References in corpus (1)

• Graphs with no 7-wheel subdivision