Cover Image

Well-Quasi-Ordering Eulerian Digraphs: Bounded Carving Width

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Cavallaro, Dario, Kawarabayashi, Ken-ichi, Kreutzer, Stephan
Format:	Preprint
Published:	2026
Subjects:	Discrete Mathematics Combinatorics 68R10 G.2.1; G.2.2
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Well-Quasi-Ordering Eulerian Digraphs Embeddable in Surfaces by Strong Immersion
by: Cavallaro, Dario, et al.
Published: (2025)

Bounds on the Twin-Width of Product Graphs
by: Pettersson, William, et al.
Published: (2022)

The Directed Disjoint Paths Problem with Congestion
by: Bentert, Matthias, et al.
Published: (2025)

On the spectra of prefix-reversal graphs
by: Blanco, Saúl A., et al.
Published: (2025)

Adjacent vertex distinguishing total coloring of 3-degenerate graphs
by: Behera, Diptimaya, et al.
Published: (2025)

Some integer values in the spectra of burnt pancake graphs
by: Blanco, Saúl A., et al.
Published: (2024)

Fast winning strategies for the attacker in eternal domination
by: Bagan, Guillaume, et al.
Published: (2024)

Optimal Bounds for the k-Disjoint Paths Problem
by: Cavallaro, Dario, et al.
Published: (2026)

Adjacency Labeling Schemes for Small Classes
by: Bonnet, Édouard, et al.
Published: (2024)

General Strong Bound on the Uncrossed Number via a Tight Bound for the Maximum Uncrossed Subgraph Number
by: Charvy, Gaspard, et al.
Published: (2025)

Homomorphism Counts to Trees
by: Dawar, Anuj
Published: (2024)

Searching by Heterogeneous Agents
by: Dereniowski, Dariusz, et al.
Published: (2021)

Minimizing an Uncrossed Collection of Drawings
by: Hliněný, Petr, et al.
Published: (2023)

On the Uncrossed Number of Graphs
by: Balko, Martin, et al.
Published: (2024)

Golden Ratio Growth and Phase Transitions in Chromatic Counts of Circular Chord Graphs
by: Lopez-Bonilla, Rogelio N., et al.
Published: (2025)

Boltzmann sampling and optimal exact-size sampling for directed acyclic graphs
by: Gabryelski, Wojciech, et al.
Published: (2026)

A Systematic Approach to Crossing Numbers of Cartesian Products with Paths
by: Asiri, Zayed, et al.
Published: (2024)

Counting Kernels in Directed Graphs with Arbitrary Orientations
by: Jartoux, Bruno
Published: (2022)

The Hierarchy of Saturating Matching Numbers
by: Simon, Hans U., et al.
Published: (2025)

Constructions, bounds, and algorithms for peaceable queens
by: Clinch, Katie, et al.
Published: (2024)

WELLDOC property for words generated by morphisms
by: Puzynina, Svetlana, et al.
Published: (2026)

Killing a Vortex
by: Thilikos, Dimitrios M., et al.
Published: (2022)

Interval Graphs are Reconstructible
by: Heinrich, Irene, et al.
Published: (2025)

A framework for distributed discrete evacuation strategies
by: Borowiecki, Piotr, et al.
Published: (2025)

Excluding a Ladder as an Induced Minor in Graphs Without Induced Stars
by: Choi, Mujin, et al.
Published: (2025)

Star-Struck by Fixed Embeddings: Modern Crossing Number Heuristics
by: Chimani, Markus, et al.
Published: (2021)

Completely independent spanning trees in the hypercube
by: Shaw, Benedict Randall
Published: (2024)

A Fast 3-Approximation for the Capacitated Tree Cover Problem with Edge Loads
by: Rockel-Wolff, Benjamin
Published: (2024)

New Results on Edge-coloring and Total-coloring of Split Graphs
by: Couto, Fernanda, et al.
Published: (2023)

Polynomial Bounds for the Graph Minor Structure Theorem
by: Gorsky, Maximilian, et al.
Published: (2025)

Breaking the Symmetries of Amenable Graphs
by: Cheng, Christine T.
Published: (2025)

The vehicle routing problem with synchronization constraints and support vehicle-dependent service times
by: Wittwer, David, et al.
Published: (2024)

Simple Approximations for General Spanner Problems
by: Bökler, Fritz, et al.
Published: (2025)

Exact Minimum Weight Spanners via Column Generation
by: Bökler, Fritz, et al.
Published: (2024)

On the thinness of trees
by: Bonomo-Braberman, Flavia, et al.
Published: (2025)

A coarse Menger's Theorem for planar and bounded genus graphs
by: Blažej, Václav, et al.
Published: (2026)

Lower Bounds for the Pfaffian Number of Graphs
by: Junchaya, Enrique, et al.
Published: (2026)

A simple algorithm for checking equivalence of counting functions on free monoids
by: Kiyashko, Petr, et al.
Published: (2024)

Simple Combinatorial Construction of the $k^{o(1)}$-Lower Bound for Approximating the Parameterized $k$-Clique
by: Chen, Yijia, et al.
Published: (2023)

Monotone Arc Diagrams with few Biarcs
by: Chaplick, Steven, et al.
Published: (2024)