Pages that link to "Item:Q661943"
From MaRDI portal
The following pages link to Characterisations and examples of graph classes with bounded expansion (Q661943):
Displaying 33 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)
- Rainbow independent sets on dense graph classes (Q831859) (← 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)
- Notes on graph product structure theory (Q2058955) (← links)
- Constant round distributed domination on graph classes with bounded expansion (Q2117740) (← links)
- Stack-number is not bounded by queue-number (Q2151179) (← links)
- On the queue-number of partial orders (Q2151446) (← links)
- On quasi-planar graphs: clique-width and logical description (Q2174559) (← links)
- Structural sparsity of complex networks: bounded expansion in random models and real-world graphs (Q2316938) (← 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)
- Nonrepetitively 3-colorable subdivisions of graphs with a logarithmic number of subdivisions per edge (Q2665958) (← links)
- On the signed chromatic number of some classes of graphs (Q2666564) (← links)
- Strongly Sublinear Separators and Polynomial Expansion (Q2808163) (← links)
- Layouts of Expander Graphs (Q3466402) (← links)
- Anagram-Free Colorings of Graph Subdivisions (Q4684464) (← links)
- Edge Partitions and Visibility Representations of 1-planar Graphs (Q5001658) (← links)
- A Unified Approach to Structural Limits and Limits of Graphs with Bounded Tree-Depth (Q5108706) (← links)
- Improved Bounds for Centered Colorings (Q5162872) (← links)
- Erdös--Hajnal Properties for Powers of Sparse Graphs (Q5857003) (← links)
- A distributed low tree-depth decomposition algorithm for bounded expansion classes (Q5964897) (← links)
- Separating layered treewidth and row treewidth (Q6045398) (← links)
- Maximum Shallow Clique Minors in Preferential Attachment Graphs Have Polylogarithmic Size (Q6084357) (← links)
- Shallow Minors, Graph Products, and Beyond-Planar Graphs (Q6130539) (← links)
- Hat Guessing Numbers of Strongly Degenerate Graphs (Q6161264) (← links)
