Indexed metadata
Full immersions in Eulerian group-labeled graphs
Ioannis Eleftheriadis, Rose McCarty, Caleb McFarland, Evangelos Protopapas, Paul Wollan
Source 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.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.