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

Documenti analoghi

• Strong isometric path complexity of graphs: Asymptotic minors, restricted holes, and graph operations
  di: Chakraborty, Dibyayan, et al.
  Pubblicazione: (2025)
• Distance-based (and path-based) covering problems for graphs of given cyclomatic number
  di: Chakraborty, Dibyayan, et al.
  Pubblicazione: (2025)
• Profile and neighbourhood complexity of graphs excluding a minor and tree-structured graphs
  di: Beaudou, Laurent, et al.
  Pubblicazione: (2025)
• Blow-up structure of graphs excluding a tree or an apex-tree as a minor
  di: Claus, Quentin, et al.
  Pubblicazione: (2026)
• Isometric path complexity of graphs
  di: Chakraborty, Dibyayan, et al.
  Pubblicazione: (2022)