Eulerian directed graphs of bounded carving width are well-quasi-ordered by strong immersion, with a meta-theorem extending to labeled vertices and edge orderings.
Well-quasi-orders on embedded planar graphs
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DM 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Well-Quasi-Ordering Eulerian Digraphs: Bounded Carving Width
Eulerian directed graphs of bounded carving width are well-quasi-ordered by strong immersion, with a meta-theorem extending to labeled vertices and edge orderings.