:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Author:	Distel, Marc
Format:	Preprint
Published:	2025
Subjects:	Combinatorics
Online Access:	https://arxiv.org/abs/2505.09834
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

An alternative characterisation of graphs quasi-isometric to graphs of bounded treewidth
by: Distel, Marc
Published: (2025)

Graphs that are quasi-isometric to graphs with bounded treewidth
by: Hickingbotham, Robert
Published: (2025)

Induced Ramsey problems for trees and graphs with bounded treewidth
by: Hunter, Zach, et al.
Published: (2024)

Chordal graphs, even-hole-free graphs and sparse obstructions to bounded treewidth
by: Hajebi, Sepehr
Published: (2024)

Linear recoloring diameter of degenerate chordal graphs and bounded treewidth graphs
by: Wang, Yichen, et al.
Published: (2025)

An improved spectral lower bound of treewidth
by: Gima, Tatsuya, et al.
Published: (2024)

Excluding a clique or a biclique in graphs of bounded induced matching treewidth
by: Abrishami, Tara, et al.
Published: (2024)

Algorithm for finding vertex-edge domination number on graphs with bounded treewidth and related problems on planar graphs
by: Wang, Yichen, et al.
Published: (2026)

Sparse graphs with bounded induced cycle packing number have logarithmic treewidth
by: Bonamy, Marthe, et al.
Published: (2022)

Clustered independence and bounded treewidth
by: Knauer, Kolja, et al.
Published: (2023)

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

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

A polynomial time algorithm to find star chromatic index on bounded treewidth graphs with given maximum degree
by: Wang, Yichen, et al.
Published: (2024)

Induced subgraphs and tree decompositions XV. Even-hole-free graphs with bounded clique number have logarithmic treewidth
by: Chudnovsky, Maria, et al.
Published: (2024)

New improved lower bounds for Zagreb indices of graphs
by: Verma, Mamta, et al.
Published: (2025)

Powers of planar graphs, product structure, and blocking partitions
by: Distel, Marc, et al.
Published: (2023)

Going deep and going wide: Counting logic and homomorphism indistinguishability over graphs of bounded treedepth and treewidth
by: Adler, Isolde, et al.
Published: (2025)

Finding subdigraphs in digraphs of bounded directed treewidth
by: Lopes, Raul, et al.
Published: (2025)

Accessibility, planar graphs, and quasi-isometries
by: MacManus, Joseph Paul
Published: (2023)

Chordal graphs with bounded tree-width
by: Castellví, Jordi, et al.
Published: (2022)

Quasi-isometries between graphs with variable edge lengths
by: Davies, James, et al.
Published: (2025)

Linear bounds on treewidth in terms of excluded planar minors
by: Gollin, J. Pascal, et al.
Published: (2024)

On the treewidth of generalized q-Kneser graphs
by: Metsch, Klaus
Published: (2024)

A quasi-optimal upper bound for induced paths in sparse graphs
by: Couëtoux, Basile, et al.
Published: (2025)

Graphs Excluding a Minor in Blowups of Treewidth 3 Graphs
by: Distel, Marc
Published: (2025)

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

Planar graphs in blowups of fans
by: Distel, Marc, et al.
Published: (2024)

An improved upper bound for the domination number of a graph
by: Arumugam, Subramanian, et al.
Published: (2024)

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

Star observations in bounded-degree graphs
by: Szegedy, Balazs
Published: (2026)

Unified bounds for the independence number of graphs
by: Zhou, Jiang
Published: (2024)

Complexes of graphs with bounded independence number
by: Kim, Minki, et al.
Published: (2019)

Dirac's theorem for graphs of bounded bandwidth
by: Díaz, Alberto Espuny, et al.
Published: (2024)

Upper bounds of Steklov eigenvalues on graphs
by: Lin, Huiqiu, et al.
Published: (2024)

Upper bounds for linear graph codes
by: Versteegen, Leo
Published: (2023)

Universality for graphs with bounded density
by: Alon, Noga, et al.
Published: (2023)

$K_{2,3}$-induced minor-free graphs admit quasi-isometry with additive distortion to graphs of tree-width at most two
by: Chakraborty, Dibyayan
Published: (2025)

An improved bound for strongly regular graphs with smallest eigenvalue $-m$
by: Koolen, Jack, et al.
Published: (2025)

An improved upper bound on the oriented diameter of graphs with diameter $4$
by: Lin, Jifu, et al.
Published: (2026)

Robertson's conjecture I. Well-quasi-ordering bounded tree-width graphs by the topological minor relation
by: Liu, Chun-Hung, et al.
Published: (2020)