Pages that link to "Item:Q1621072"
From MaRDI portal
The following pages link to Characterising bounded expansion by neighbourhood complexity (Q1621072):
Displaying 11 items.
- Harmless sets in sparse classes (Q2169963) (← links)
- On quasi-planar graphs: clique-width and logical description (Q2174559) (← links)
- Bounds on half graph orders in powers of sparse graphs (Q2699651) (← links)
- Digraphs of Bounded Width (Q3120441) (← links)
- Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-wideness (Q4984870) (← links)
- (Q5090497) (← links)
- Lossy Kernels for Connected Dominating Set on Sparse Graphs (Q5234662) (← links)
- Neighbourhood complexity of graphs of bounded twin-width (Q6081102) (← links)
- (Q6089655) (← links)
- Hat Guessing Numbers of Strongly Degenerate Graphs (Q6161264) (← links)
- Bounding generalized coloring numbers of planar graphs using coin models (Q6199193) (← links)
