Pages that link to "Item:Q661943"
From MaRDI portal
The following pages link to Characterisations and examples of graph classes with bounded expansion (Q661943):
Displayed 16 items.
- List rankings and on-line list rankings of graphs (Q266945) (← links)
- Kernelization using structural parameters on sparse graph classes (Q340583) (← links)
- Graph sharing games: complexity and connectivity (Q391088) (← links)
- On the queue-number of graphs with bounded tree-width (Q521397) (← links)
- Nonrepetitive colouring via entropy compression (Q524188) (← links)
- On the treewidth of dynamic graphs (Q744102) (← links)
- Sublinear separators, fragility and subexponential expansion (Q896068) (← links)
- Characterising bounded expansion by neighbourhood complexity (Q1621072) (← links)
- The queue-number of posets of bounded width or height (Q1725753) (← links)
- An annotated bibliography on 1-planarity (Q2407041) (← links)
- Layered separators in minor-closed graph classes with applications (Q2407382) (← links)
- The \(k\)-strong induced arboricity of a graph (Q2408964) (← links)
- Strongly Sublinear Separators and Polynomial Expansion (Q2808163) (← links)
- Layouts of Expander Graphs (Q3466402) (← links)
- Anagram-Free Colorings of Graph Subdivisions (Q4684464) (← links)
- A distributed low tree-depth decomposition algorithm for bounded expansion classes (Q5964897) (← links)