The following pages link to On nowhere dense graphs (Q2430977):
Displaying 50 items.
- Kernelization using structural parameters on sparse graph classes (Q340583) (← links)
- Parameterized complexity of generalized domination problems (Q415279) (← links)
- Confronting intractability via parameters (Q465686) (← links)
- Practical algorithms for MSO model-checking on tree-decomposable graphs (Q473216) (← links)
- How many \(F\)'s are there in \(G\)? (Q648970) (← links)
- Characterisations and examples of graph classes with bounded expansion (Q661943) (← links)
- On the treewidth of dynamic graphs (Q744102) (← links)
- Vapnik-Chervonenkis dimension and density on Johnson and Hamming graphs (Q831858) (← links)
- Rainbow independent sets on dense graph classes (Q831859) (← links)
- First-order limits, an analytical perspective (Q896082) (← links)
- On low tree-depth decompositions (Q897253) (← links)
- Reconfiguration on nowhere dense graph classes (Q1658772) (← links)
- Towards a characterization of universal categories (Q1684740) (← links)
- FPT algorithms for domination in sparse graphs and beyond (Q1740694) (← links)
- Polynomial bounds for centered colorings on proper minor-closed graph classes (Q1984513) (← links)
- Faster algorithms for counting subgraphs in sparse graphs (Q2041986) (← links)
- Discrete density comonads and graph parameters (Q2104475) (← links)
- Clustering powers of sparse graphs (Q2209886) (← links)
- Uniform orderings for generalized coloring numbers (Q2225419) (← links)
- Classes of graphs with low complexity: the case of classes with bounded linear rankwidth (Q2225428) (← links)
- On the parameterized complexity of \([1,j]\)-domination problems (Q2283043) (← links)
- Interpreting nowhere dense graph classes as a classical notion of model theory (Q2441640) (← links)
- Distance-two coloring of sparse graphs (Q2441647) (← links)
- Modeling limits in hereditary classes: reduction and application to trees (Q2629494) (← links)
- Kernelization and approximation of distance-\(r\) independent sets on nowhere dense graphs (Q2662795) (← links)
- 1-subdivisions, the fractional chromatic number and the Hall ratio (Q2663411) (← links)
- Bounds on half graph orders in powers of sparse graphs (Q2699651) (← links)
- Colouring and Covering Nowhere Dense Graphs (Q2827820) (← links)
- Counting Homomorphisms to Sparse Graphs (Q2851494) (← links)
- Digraphs of Bounded Width (Q3120441) (← links)
- Lossy Kernels for Connected Dominating Set on Sparse Graphs (Q3304128) (← 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)
- On the Parameterized Complexity of [1,j]-Domination Problems (Q5090974) (← links)
- A Unified Approach to Structural Limits and Limits of Graphs with Bounded Tree-Depth (Q5108706) (← links)
- (Q5109514) (← links)
- Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-Wideness (Q5140724) (← links)
- Improved Bounds for Centered Colorings (Q5162872) (← links)
- EXISTENCE OF MODELING LIMITS FOR SEQUENCES OF SPARSE STRUCTURES (Q5222519) (← links)
- Lossy Kernels for Connected Dominating Set on Sparse Graphs (Q5234662) (← links)
- Structural Properties of Sparse Graphs (Q5301017) (← links)
- (Q5743498) (← links)
- Erdös--Hajnal Properties for Powers of Sparse Graphs (Q5857003) (← links)
- Enumeration for FO Queries over Nowhere Dense Graphs (Q5889796) (← links)
- On the generalised colouring numbers of graphs that exclude a fixed minor (Q5890918) (← links)
- On low rank-width colorings (Q5918207) (← links)
- Parameterized complexity of conflict-free set cover (Q5918356) (← links)
- Conflict free version of covering problems on graphs: classical and parameterized (Q5918906) (← links)
