Well-Quasi-Ordering Eulerian Digraphs: Bounded Carving Width

Dario Cavallaro, Ken-ichi Kawarabayashi, Stephan Kreutzer

We prove that every class of Eulerian directed graphs of bounded carving width (equivalently of bounded degree and treewidth) is well-quasi-ordered by strong immersion. In fact, we…