Pages that link to "Item:Q4931094"
From MaRDI portal
The following pages link to First order properties on nowhere dense structures (Q4931094):
Displaying 31 items.
- Kernelization using structural parameters on sparse graph classes (Q340583) (← links)
- Parameterized complexity of generalized domination problems (Q415279) (← links)
- How many \(F\)'s are there in \(G\)? (Q648970) (← links)
- Characterisations and examples of graph classes with bounded expansion (Q661943) (← links)
- First-order limits, an analytical perspective (Q896082) (← links)
- Triangle-free planar graphs with small independence number (Q1633607) (← 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)
- Reconfiguration on sparse graphs (Q1747496) (← links)
- On classes of graphs with strongly sublinear separators (Q1750205) (← 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)
- On nowhere dense graphs (Q2430977) (← links)
- Interpreting nowhere dense graph classes as a classical notion of model theory (Q2441640) (← links)
- Modeling limits in hereditary classes: reduction and application to trees (Q2629494) (← links)
- Bounds on half graph orders in powers of sparse graphs (Q2699651) (← links)
- Counting Homomorphisms to Sparse Graphs (Q2851494) (← links)
- Lossy Kernels for Connected Dominating Set on Sparse Graphs (Q3304128) (← 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)
- Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-Wideness (Q5140724) (← links)
- EXISTENCE OF MODELING LIMITS FOR SEQUENCES OF SPARSE STRUCTURES (Q5222519) (← links)
- Lossy Kernels for Connected Dominating Set on Sparse Graphs (Q5234662) (← links)
- Large Independent Sets in Triangle-Free Planar Graphs (Q5270410) (← links)
- (Q5743498) (← links)
- Enumeration for FO Queries over Nowhere Dense Graphs (Q5889796) (← links)
- Bounds on half graph orders in powers of sparse graphs (Q6604703) (← links)
