Splitter Theorems for Graph Immersions

MaRDI QIDQ6305615zbMATH OpenFDO

Authors Matt DeVos

Publication date 20 August 2018

Mathematics Subject Classification ID

Connectivity (05C40) Graph minors (05C83)

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.

This page was built for publication: Splitter Theorems for Graph Immersions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6305615)