Imagen de Portada

Directed treewidth is closed under taking butterfly minors

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Kim, Gunwoo, Hatzel, Meike, Kreutzer, Stephan
Formato:	Preprint
Publicado:	2025
Materias:	Combinatorics Discrete Mathematics
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Unavoidable butterfly minors in digraphs of large cycle rank
por: Hatzel, Meike, et al.
Publicado: (2025)

Cycles of Well-Linked Sets II: an Elementary Bound for the Directed Grid Theorem
por: Hatzel, Meike, et al.
Publicado: (2026)

Bounds on treewidth via excluding disjoint unions of cycles
por: Hatzel, Meike, et al.
Publicado: (2025)

Odd-Cycle-Packing-treewidth: On the Maximum Independent Set problem in odd-minor-free graph classes
por: Choi, Mujin, et al.
Publicado: (2025)

On graphs coverable by chubby shortest paths
por: Hatzel, Meike, et al.
Publicado: (2025)

Computing $\vec{\mathcal{S}}$-DAGs and Parity Games
por: Hatzel, Meike, et al.
Publicado: (2024)

Cycles of Well-Linked Sets I: an Elementary Bound for Directed Cycle Packing
por: Hatzel, Meike, et al.
Publicado: (2024)

On graphs with a simple structure of maximal cliques
por: Gollin, J. Pascal, et al.
Publicado: (2025)

Note on the treewidth of graphs excluding a disjoint union of cycles as a minor
por: Joret, Gwenaël, et al.
Publicado: (2026)

Erdős-Pósa property of tripods in directed graphs
por: Briański, Marcin, et al.
Publicado: (2024)

Approximating temporal modularity on graphs of small underlying treewidth
por: Agdur, Vilhelm, et al.
Publicado: (2025)

Odd coloring graphs with linear neighborhood complexity
por: Davies, James, et al.
Publicado: (2025)

Tight bound on treedepth in terms of pathwidth and longest path
por: Hatzel, Meike, et al.
Publicado: (2023)

The treewidth and pathwidth of graph unions
por: Alecu, Bogdan, et al.
Publicado: (2022)

Clustered independence and bounded treewidth
por: Knauer, Kolja, et al.
Publicado: (2023)

Centered colorings in minor-closed graph classes
por: Hodor, Jędrzej, et al.
Publicado: (2024)

Weak coloring numbers of minor-closed graph classes
por: Hodor, Jędrzej, et al.
Publicado: (2024)

Adjacency labelling for proper minor-closed graph classes
por: Dujmović, Vida, et al.
Publicado: (2026)

Half-integral Erdős-Pósa property for non-null $S$-$T$ paths
por: Chekan, Vera, et al.
Publicado: (2024)

On universal graphs for trees and treewidth $k$ graphs
por: Kaul, Neel, et al.
Publicado: (2025)

Redicolouring digraphs: directed treewidth and cycle-degeneracy
por: Nisse, Nicolas, et al.
Publicado: (2023)

Induced matching treewidth and tree-independence number, revisited
por: Alon, Noga, et al.
Publicado: (2025)

Centered colorings and weak coloring numbers in minor-closed graph classes
por: Hodor, Jędrzej, et al.
Publicado: (2026)

Reduced bandwidth: a qualitative strengthening of twin-width in minor-closed classes (and beyond)
por: Bonnet, Édouard, et al.
Publicado: (2022)

First-Order Logic and Twin-Width for Some Geometric Graphs
por: Geniet, Colin, et al.
Publicado: (2025)

Unavoidable induced subgraphs in graphs with complete bipartite induced minors
por: Chudnovsky, Maria, et al.
Publicado: (2024)

Strongly sublinear separators and bounded asymptotic dimension for sphere intersection graphs
por: Davies, James, et al.
Publicado: (2025)

Braces of Perfect Matching Width 2
por: Giannopoulou, Archontia C., et al.
Publicado: (2019)

Clique-width and induced topological minors
por: Bieliński, Paweł Rafał, et al.
Publicado: (2026)

Branch-depth is minor closure of contraction-deletion-depth
por: Briański, Marcin, et al.
Publicado: (2024)

Tight bound for the Erdős-Pósa property of tree minors
por: Dujmović, Vida, et al.
Publicado: (2024)

Parameterized complexity of isometric path partition: treewidth and diameter
por: Chakraborty, Dibyayan, et al.
Publicado: (2025)

Monotonicity of the cops and robber game for bounded depth treewidth
por: Adler, Isolde, et al.
Publicado: (2024)

A polynomial bound for the minimal excluded minors for a surface
por: Houdaigoui, Sarah, et al.
Publicado: (2026)

On 3-Connected Cubic Planar Graphs and their Strong Embeddings on Orientable Surfaces
por: Weiß, Meike, et al.
Publicado: (2025)

On 3-Connected Planar Graphs with Unique Orientable Circuit Double Covers
por: Weiß, Meike, et al.
Publicado: (2026)

A quasi-polynomial bound for the minimal excluded minors for a surface
por: Houdaigoui, Sarah, et al.
Publicado: (2025)

Profile and neighbourhood complexity of graphs excluding a minor and tree-structured graphs
por: Beaudou, Laurent, et al.
Publicado: (2025)

Strong isometric path complexity of graphs: Asymptotic minors, restricted holes, and graph operations
por: Chakraborty, Dibyayan, et al.
Publicado: (2025)

Blow-up structure of graphs excluding a tree or an apex-tree as a minor
por: Claus, Quentin, et al.
Publicado: (2026)