Bounds on half graph orders in powers of sparse graphs
From MaRDI portal
Publication:6604703
DOI10.1007/978-3-030-83823-2_39MaRDI QIDQ6604703
Publication date: 13 September 2024
Cites Work
- Unnamed Item
- Sparsity. Graphs, structures, and algorithms
- Characterising bounded expansion by neighbourhood complexity
- Interpreting nowhere dense graph classes as a classical notion of model theory
- The Grad of a Graph and Classes with Bounded Expansion
- Applications of a Planar Separator Theorem
- First order properties on nowhere dense structures
- On the generalised colouring numbers of graphs that exclude a fixed minor
This page was built for publication: Bounds on half graph orders in powers of sparse graphs
