Full immersions in Eulerian group-labeled graphs
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.
Authors
- Rose McCarty (ORCID: https://orcid.org/0000-0002-9884-3406)
- Evangelos Protopapas (ORCID: https://orcid.org/0000-0003-0294-2985)
- Paul Wollan
- Ioannis Eleftheriadis (ORCID: https://orcid.org/0000-0003-4764-8894)
- Caleb McFarland (ORCID: https://orcid.org/0009-0002-9844-6256)
Publication Details
- Journal
- arXiv (Cornell University)
- Published
- 2026-10-29
- DOI
- https://doi.org/10.48550/arxiv.2610.40132
- Primary Topic
- Advanced Graph Theory Research
- Type
- preprint