Pages that link to "Item:Q2827820"
From MaRDI portal
The following pages link to Colouring and Covering Nowhere Dense Graphs (Q2827820):
Displaying 12 items.
- Chromatic numbers of exact distance graphs (Q1633747) (← links)
- Edge degeneracy: algorithmic and structural results (Q2196572) (← links)
- Uniform orderings for generalized coloring numbers (Q2225419) (← links)
- On the weak 2-coloring number of planar graphs (Q2237215) (← links)
- 2-coloring number revisited (Q2333797) (← links)
- On the Block Number of Graphs (Q4623134) (← 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)
- On the generalised colouring numbers of graphs that exclude a fixed minor (Q5890918) (← links)
- On the generalised colouring numbers of graphs that exclude a fixed minor (Q5920084) (← links)
- A color-avoiding approach to subgraph counting in bounded expansion classes (Q6174815) (← links)
