Strong Immersions and Maximum Degree
Strong Immersions and Maximum Degree
A graph $H$ is strongly immersed in $G$ if $G$ is obtained from $H$ by a sequence of vertex splittings (i.e., lifting some pairs of incident edges and removing the vertex) and edge removals. Equivalently, vertices of $H$ are mapped to distinct vertices of $G$ (branch vertices), and edges of …