Pages that link to "Item:Q2963895"
From MaRDI portal
The following pages link to Characterisations of nowhere dense graphs (invited talk) (Q2963895):
Displaying 18 items.
- On ultralimits of sparse graph classes (Q286118) (← links)
- How many \(F\)'s are there in \(G\)? (Q648970) (← links)
- Characterising bounded expansion by neighbourhood complexity (Q1621072) (← links)
- Reconfiguration on sparse graphs (Q1747496) (← links)
- A constant amortized time enumeration algorithm for independent sets in graphs with bounded clique number (Q2034408) (← links)
- Faster algorithms for counting subgraphs in sparse graphs (Q2041986) (← links)
- Nowhere dense graph classes and dimension (Q2288358) (← links)
- Building efficient and compact data structures for simplicial complexes (Q2408925) (← links)
- The \(k\)-strong induced arboricity of a graph (Q2408964) (← links)
- On nowhere dense graphs (Q2430977) (← links)
- Interpreting nowhere dense graph classes as a classical notion of model theory (Q2441640) (← links)
- Structural sparsity (Q2815673) (← links)
- Colouring and Covering Nowhere Dense Graphs (Q2827820) (← links)
- Coloring and Covering Nowhere Dense Graphs (Q4553722) (← links)
- Structural properties and constant factor-approximation of strong distance-\(r\) dominating sets in sparse directed graphs (Q4636649) (← links)
- Algorithms for Classes of Graphs with Bounded Expansion (Q5851090) (← links)
- k-Efficient domination: Algorithmic perspective (Q6115759) (← links)
- A color-avoiding approach to subgraph counting in bounded expansion classes (Q6174815) (← links)
