Pages that link to "Item:Q5395732"
From MaRDI portal
The following pages link to Testing first-order properties for subclasses of sparse graphs (Q5395732):
Displaying 47 items.
- Dominating set is fixed parameter tractable in claw-free graphs (Q650938) (← links)
- Compactors for parameterized counting problems (Q826317) (← links)
- Sublinear separators, fragility and subexponential expansion (Q896068) (← links)
- On low tree-depth decompositions (Q897253) (← links)
- FO model checking on geometric graphs (Q1631773) (← links)
- Polynomial bounds for centered colorings on proper minor-closed graph classes (Q1984513) (← links)
- From \(\chi\)- to \(\chi_p\)-bounded classes (Q2099414) (← links)
- Polynomial treedepth bounds in linear colorings (Q2223702) (← 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)
- Structural sparsity of complex networks: bounded expansion in random models and real-world graphs (Q2316938) (← links)
- On the number of cliques in graphs with a forbidden minor (Q2399355) (← links)
- Grad and classes with bounded expansion. II: Algorithmic aspects (Q2426457) (← 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)
- Colouring and Covering Nowhere Dense Graphs (Q2827820) (← links)
- Coloring and Covering Nowhere Dense Graphs (Q4553722) (← links)
- Hyperbolic families and coloring graphs on surfaces (Q4560169) (← links)
- Completeness for First-order Properties on Sparse Structures with Algorithmic Applications (Q4629991) (← links)
- Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-wideness (Q4984870) (← links)
- (Q5002812) (← links)
- Reducing CMSO model checking to highly connected graphs (Q5002822) (← links)
- Recovering sparse graphs (Q5005129) (← links)
- Test dense subgraphs in sparse uniform hypergraph (Q5079097) (← links)
- Elimination Distance to Bounded Degree on Planar Graphs (Q5089238) (← links)
- (Q5090476) (← links)
- (Q5090497) (← links)
- (Q5091010) (← links)
- (Q5092402) (← links)
- (Q5094135) (← 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)
- Large Independent Sets in Triangle-Free Planar Graphs (Q5270410) (← links)
- Algorithms for Classes of Graphs with Bounded Expansion (Q5851090) (← links)
- On the Number of Cliques in Graphs with a Forbidden Subdivision or Immersion (Q5855529) (← links)
- Erdös--Hajnal Properties for Powers of Sparse Graphs (Q5857003) (← links)
- (Q5874521) (← links)
- On low rank-width colorings (Q5918207) (← links)
- On the generalised colouring numbers of graphs that exclude a fixed minor (Q5920084) (← links)
- A distributed low tree-depth decomposition algorithm for bounded expansion classes (Q5964897) (← links)
- Lacon-, Shrub- and Parity-Decompositions: Characterizing Transductions of Bounded Expansion Classes (Q6135763) (← links)
- Three-coloring triangle-free graphs on surfaces. VI: 3-colorability of quadrangulations (Q6184892) (← links)
- Elimination distance to bounded degree on planar graphs preprint (Q6593702) (← links)
- Discrepancy and sparsity (Q6615750) (← links)
- Counting subgraphs in somewhere dense graphs (Q6621747) (← links)
- Treelike decompositions for transductions of sparse graphs (Q6649461) (← links)
