Shallow brambles

DOI10.46298/DMTCS.15257MaRDI QIDQ7257272zbMATH OpenFDO

Authors Nicolas Bousquet, Wouter Cames van Batenburg, L. Esperet, Gwenaël Joret, Piotr Micek

Publication date 4 June 2026

Published in Discrete Mathematics and Theoretical Computer Science. DMTCS (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.46298/DMTCS.15257

zbMATH Keywords

bramblespolynomial expansionshallow minorssparsity

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Density (toughness, etc.) (05C42)

Cites work

• Coloring and covering nowhere dense graphs
• Colouring graphs with bounded generalized colouring number
• Constant-factor approximation of the domination number in sparse graphs
• Graph minors. V. Excluding a planar graph
• Graph minors. X: Obstructions to tree-decomposition
• Graph searching and a min-max theorem for tree-width
• Graph Theory and Probability
• scientific article; zbMATH DE number 1057879 (Why is no real title available?)
• Mengerian theorems for paths of bounded length
• Minors in graphs of large girth
• Orderings on graphs and game coloring number
• Polynomial expansion and sublinear separators
• Sparsity. Graphs, structures, and algorithms
• Strongly sublinear separators and polynomial expansion

This page was built for publication: Shallow brambles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7257272)