Splitter theorems for graph immersions

Abstract

We establish splitter theorems for graph immersions for two families of graphs, $k$-edge-connected graphs, with $k$ even, and 3-edge-connected, internally 4-edge-connected graphs. As a corollary, we prove that every 3-edge-connected, internally 4-edge-connected graph on at least seven vertices that immerses $K_5$ also has $K_{3,3}$ as an immersion.