Pages that link to "Item:Q5145357"
From MaRDI portal
The following pages link to On the number of types in sparse graphs (Q5145357):
Displaying 19 items.
- How many \(F\)'s are there in \(G\)? (Q648970) (← links)
- On the parameterized complexity of reconfiguration of connected dominating sets (Q832526) (← links)
- Reconfiguration on nowhere dense graph classes (Q1658772) (← links)
- Regular partitions of gentle graphs (Q2216929) (← links)
- Classes of graphs with low complexity: the case of classes with bounded linear rankwidth (Q2225428) (← links)
- On nowhere dense graphs (Q2430977) (← links)
- Interpreting nowhere dense graph classes as a classical notion of model theory (Q2441640) (← 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)
- Counting homomorphisms to sparse graphs (Q2851494) (← links)
- Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-wideness (Q4984870) (← links)
- (Q5089253) (← links)
- (Q5090476) (← links)
- Lossy Kernels for Connected Dominating Set on Sparse Graphs (Q5234662) (← links)
- Erdös--Hajnal Properties for Powers of Sparse Graphs (Q5857003) (← links)
- (Q6089671) (← links)
- Lacon-, Shrub- and Parity-Decompositions: Characterizing Transductions of Bounded Expansion Classes (Q6135763) (← links)
- Discrepancy and sparsity (Q6615750) (← links)
- Treelike decompositions for transductions of sparse graphs (Q6649461) (← links)
