Image de couverture de livre

Bounds on treewidth via excluding disjoint unions of cycles

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Hatzel, Meike, Liu, Chun-Hung, Reed, Bruce, Wiederrecht, Sebastian
Format:	Preprint
Publié:	2025
Sujets:	Combinatorics Discrete Mathematics
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Note on the treewidth of graphs excluding a disjoint union of cycles as a minor
par: Joret, Gwenaël, et autres
Publié: (2026)

Unavoidable butterfly minors in digraphs of large cycle rank
par: Hatzel, Meike, et autres
Publié: (2025)

On graphs with a simple structure of maximal cliques
par: Gollin, J. Pascal, et autres
Publié: (2025)

Directed treewidth is closed under taking butterfly minors
par: Kim, Gunwoo, et autres
Publié: (2025)

Braces of Perfect Matching Width 2
par: Giannopoulou, Archontia C., et autres
Publié: (2019)

On graphs coverable by chubby shortest paths
par: Hatzel, Meike, et autres
Publié: (2025)

Computing $\vec{\mathcal{S}}$-DAGs and Parity Games
par: Hatzel, Meike, et autres
Publié: (2024)

The treewidth and pathwidth of graph unions
par: Alecu, Bogdan, et autres
Publié: (2022)

Odd-Cycle-Packing-treewidth: On the Maximum Independent Set problem in odd-minor-free graph classes
par: Choi, Mujin, et autres
Publié: (2025)

Cycles of Well-Linked Sets II: an Elementary Bound for the Directed Grid Theorem
par: Hatzel, Meike, et autres
Publié: (2026)

Redicolouring digraphs: directed treewidth and cycle-degeneracy
par: Nisse, Nicolas, et autres
Publié: (2023)

Coarse Menger property of quasi-minor excluded graphs and length spaces
par: Liu, Chun-Hung
Publié: (2026)

Erdős-Pósa property of tripods in directed graphs
par: Briański, Marcin, et autres
Publié: (2024)

Unavoidable induced subgraphs in graphs with complete bipartite induced minors
par: Chudnovsky, Maria, et autres
Publié: (2024)

Odd coloring graphs with linear neighborhood complexity
par: Davies, James, et autres
Publié: (2025)

Tight bound on treedepth in terms of pathwidth and longest path
par: Hatzel, Meike, et autres
Publié: (2023)

Clustered independence and bounded treewidth
par: Knauer, Kolja, et autres
Publié: (2023)

Half-integral Erdős-Pósa property for non-null $S$-$T$ paths
par: Chekan, Vera, et autres
Publié: (2024)

On universal graphs for trees and treewidth $k$ graphs
par: Kaul, Neel, et autres
Publié: (2025)

Induced matching treewidth and tree-independence number, revisited
par: Alon, Noga, et autres
Publié: (2025)

Approximating temporal modularity on graphs of small underlying treewidth
par: Agdur, Vilhelm, et autres
Publié: (2025)

Quickly excluding an apex-forest
par: Hodor, Jędrzej, et autres
Publié: (2024)

Packing Topological Minors Half-Integrally
par: Liu, Chun-Hung
Publié: (2017)

A polynomial bound for the minimal excluded minors for a surface
par: Houdaigoui, Sarah, et autres
Publié: (2026)

Strongly sublinear separators and bounded asymptotic dimension for sphere intersection graphs
par: Davies, James, et autres
Publié: (2025)

A quasi-polynomial bound for the minimal excluded minors for a surface
par: Houdaigoui, Sarah, et autres
Publié: (2025)

Profile and neighbourhood complexity of graphs excluding a minor and tree-structured graphs
par: Beaudou, Laurent, et autres
Publié: (2025)

Vertex Ranking of Degenerate Graphs
par: Iacono, John, et autres
Publié: (2024)

Blow-up structure of graphs excluding a tree or an apex-tree as a minor
par: Claus, Quentin, et autres
Publié: (2026)

Product Structure and Tree-Decompositions
par: Liu, Chun-Hung, et autres
Publié: (2024)

Internally-disjoint directed pendant Steiner trees with three terminal vertices in Cartesian product digraphs
par: Yu, Shanshan, et autres
Publié: (2026)

Cycles of Well-Linked Sets I: an Elementary Bound for Directed Cycle Packing
par: Hatzel, Meike, et autres
Publié: (2024)

Parameterized complexity of isometric path partition: treewidth and diameter
par: Chakraborty, Dibyayan, et autres
Publié: (2025)

Monotonicity of the cops and robber game for bounded depth treewidth
par: Adler, Isolde, et autres
Publié: (2024)

Conflict-Free Coloring: Graphs of Bounded Clique Width and Intersection Graphs
par: Bhyravarapu, Sriram, et autres
Publié: (2021)

Basis sequence reconfiguration in the union of matroids
par: Hanaka, Tesshu, et autres
Publié: (2024)

Structure and algorithms for graphs excluding grids with small parity breaks as odd-minors
par: Gollin, J. Pascal, et autres
Publié: (2023)

On 3-Connected Cubic Planar Graphs and their Strong Embeddings on Orientable Surfaces
par: Weiß, Meike, et autres
Publié: (2025)

On 3-Connected Planar Graphs with Unique Orientable Circuit Double Covers
par: Weiß, Meike, et autres
Publié: (2026)

A Vizing-like theorem for union vertex-distinguishing edge coloring
par: Bousquet, Nicolas, et autres
Publié: (2016)