Full immersions in Eulerian group-labeled graphs
arXiv:2610.40132
Abstract
An immersion of a graph H in a graph G is full if the immersion uses every edge of G. We give a structure theorem for group-labeled Eulerian graphs excluding a fixed group-labeled graph as a full immersion.