Pages that link to "Item:Q5111394"
From MaRDI portal
The following pages link to Neighborhood complexity and kernelization for nowhere dense classes of graphs (Q5111394):
Displaying 23 items.
- Vapnik-Chervonenkis dimension and density on Johnson and Hamming graphs (Q831858) (← links)
- On the parameterized complexity of reconfiguration of connected dominating sets (Q832526) (← links)
- Reconfiguration on nowhere dense graph classes (Q1658772) (← links)
- Constant round distributed domination on graph classes with bounded expansion (Q2117740) (← links)
- Improved bounds for weak coloring numbers (Q2121806) (← links)
- On quasi-planar graphs: clique-width and logical description (Q2174559) (← links)
- Kernelization and approximation of distance-\(r\) independent sets on nowhere dense graphs (Q2662795) (← links)
- Bounds on half graph orders in powers of sparse graphs (Q2699651) (← links)
- Lossy Kernels for Connected Dominating Set on Sparse Graphs (Q3304128) (← links)
- Bidimensionality and Kernels (Q3387764) (← links)
- Coloring and Covering Nowhere Dense Graphs (Q4553722) (← links)
- Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-wideness (Q4984870) (← links)
- (Q5090476) (← links)
- (Q5090497) (← links)
- (Q5092402) (← links)
- (Q5116487) (← links)
- Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-Wideness (Q5140724) (← links)
- Lossy Kernels for Connected Dominating Set on Sparse Graphs (Q5234662) (← links)
- Erdös--Hajnal Properties for Powers of Sparse Graphs (Q5857003) (← links)
- On the generalised colouring numbers of graphs that exclude a fixed minor (Q5920084) (← links)
- Neighbourhood complexity of graphs of bounded twin-width (Q6081102) (← links)
- Maximum Shallow Clique Minors in Preferential Attachment Graphs Have Polylogarithmic Size (Q6084357) (← links)
- (Q6089671) (← links)
