Skip to content
DraconiticResearch
Search Sources API
194,226 studies31 sourcesUpdated 54 min ago
PreprintCC BY 4.0arXiv

Full immersions in Eulerian group-labeled graphs

  • Ioannis Eleftheriadis
  • Rose McCarty
  • Caleb McFarland
  • Evangelos Protopapas
  • Paul Wollan
Open at sourcePDFDOICite

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.

Related

  1. Finding full immersions is fixed-parameter tractable in labeled tour graphs
    Hadas Barabash, Jim Geelen, Rose McCarty +2
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  2. Strong complete immersions in graphs with independence number two
    Zijian Deng, Chuanshu Wu
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  3. Proximity Theorem and FPT Algorithm for Minimum Group-labeled Matroid Bases
    Siyue Liu, Taihei Oki, Chao Xu
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  4. Computing and Bounding the Number of Eulerian Orientations for Certain Classes of $4$-Regular Graphs
    Evangelos Bartzos, Michalis Samaris
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  5. The q-analogues of γ-positivity of Eulerian polynomials via group actions
    Taifeng Ding, Lintong Wang, Sherry H. F. Yan
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv

Cite

BibTeXRIS
BibTeX
@misc{eleftheriadis2026full,
  title = {{Full immersions in Eulerian group-labeled graphs}},
  author = {Ioannis Eleftheriadis and Rose McCarty and Caleb McFarland and Evangelos Protopapas and Paul Wollan},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.40132},
  eprint = {2610.40132},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.40132},
  note = {CC BY 4.0},
}
RIS
TY  - UNPB
TI  - Full immersions in Eulerian group-labeled graphs
AU  - Ioannis Eleftheriadis
AU  - Rose McCarty
AU  - Caleb McFarland
AU  - Evangelos Protopapas
AU  - Paul Wollan
PY  - 2026
DA  - 2026/10/29
PB  - arXiv
DO  - 10.48550/arxiv.2610.40132
UR  - https://arxiv.org/abs/2610.40132
AB  - 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.
ER  -