Imagen de Portada

An improved quasi-isometry between graphs of bounded cliquewidth and graphs of bounded treewidth

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Distel, Marc
Formato:	Preprint
Publicado:	2025
Materias:	Combinatorics
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Accessibility, planar graphs, and quasi-isometries
por: MacManus, Joseph Paul
Publicado: (2023)

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

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

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

Star observations in bounded-degree graphs
por: Szegedy, Balazs
Publicado: (2026)

Unified bounds for the independence number of graphs
por: Zhou, Jiang
Publicado: (2024)

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

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

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

Upper bounds for linear graph codes
por: Versteegen, Leo
Publicado: (2023)

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

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

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

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

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

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

On $k$-coalition in graphs: bounds and exact values
por: Brešar, Boštjan, et al.
Publicado: (2025)

Optimal $χ$-boundness of $\ell$-holed graphs
por: Wang, Yan, et al.
Publicado: (2025)