Cover Image

$K_{2,3}$-induced minor-free graphs admit quasi-isometry with additive distortion to graphs of tree-width at most two

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Chakraborty, Dibyayan
Format:	Preprint
Published:	2025
Subjects:	Combinatorics Discrete Mathematics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

Distance-based (and path-based) covering problems for graphs of given cyclomatic number
by: Chakraborty, Dibyayan, et al.
Published: (2025)

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

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

Isometric path complexity of graphs
by: Chakraborty, Dibyayan, et al.
Published: (2022)

Packing chromatic critical graphs with radius at most 2
by: Gür, Aslıhan, et al.
Published: (2026)

Independent sets and colorings of $K_{t,t,t}$-free graphs
by: Dhawan, Abhishek, et al.
Published: (2025)

The strong chromatic index of $K_{t,t}$-free graphs
by: Bi, Richard, et al.
Published: (2026)

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

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

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

Complete polyhedral description of chemical graphs of maximum degree at most 3
by: Dusollier, Valentin, et al.
Published: (2025)

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

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

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

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

Vertex-critical graphs in co-gem-free graphs
by: Beaton, Iain, et al.
Published: (2024)

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

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

($P_2+P_4$, $K_4-e$)-free graphs are nearly $ω$-colorable
by: Angeliya, C. U., et al.
Published: (2025)

On the finiteness of $k$-vertex-critical $2P_2$-free graphs with forbidden induced squids or bulls
by: Adekanye, Melvin, et al.
Published: (2024)

Extremal chemical graphs of maximum degree at most 3 for 33 degree-based topological indices
by: Bonte, Sébastien, et al.
Published: (2025)

On open-separating dominating codes in graphs
by: Chakraborty, Dipayan, et al.
Published: (2024)

Long induced paths in sparse graphs and graphs with forbidden patterns
by: Duron, Julien, et al.
Published: (2024)

Hitting all longest paths in $H$-free graphs and $H$-graphs
by: de Lima, Paloma T., et al.
Published: (2025)

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

An optimal chromatic bound for ($P_2+P_3$, gem)-free graphs
by: Char, Arnab, et al.
Published: (2024)

Path eccentricity of $k$-AT-free graphs and application on graphs with the consecutive ones property
by: Bastide, Paul, et al.
Published: (2024)

$θ$-free matching covered graphs
by: Joshi, Rohinee, et al.
Published: (2024)

Coloring bridge-free antiprismatic graphs
by: Robin, Cléophée, et al.
Published: (2024)

Non-crossing $H$-graphs: a generalization of proper interval graphs admitting FPT algorithms
by: Bonomo-Braberman, Flavia, et al.
Published: (2025)

Nucleation-free independent graphs with implied nonedges
by: Cheng, Jialong, et al.
Published: (2025)

Secure domination in $P_5$-free graphs
by: Gupta, Uttam K., et al.
Published: (2025)

Proper conflict-free choosability of planar graphs
by: Wang, Yuting, et al.
Published: (2025)

Computing fixed point free automorphisms of graphs
by: Abiad, Aida, et al.
Published: (2026)

Listing spanning trees of outerplanar graphs by pivot-exchanges
by: Behrooznia, Nastaran, et al.
Published: (2024)

A note on highly connected $K_{2,\ell}$-minor free graphs
by: Bousquet, Nicolas, et al.
Published: (2023)

The sandwich problem for odd-hole-free and even-hole-free graphs
by: Cameron, Kathie, et al.
Published: (2024)

The structure of quasi-transitive graphs avoiding a minor with applications to the domino problem
by: Esperet, Louis, et al.
Published: (2023)

On three domination-based identification problems in block graphs
by: Chakraborty, Dipayan, et al.
Published: (2018)