Pages that link to "Item:Q2426457"
From MaRDI portal
The following pages link to Grad and classes with bounded expansion. II: Algorithmic aspects (Q2426457):
Displaying 50 items.
- List rankings and on-line list rankings of graphs (Q266945) (← links)
- Forbidden graphs for tree-depth (Q412288) (← links)
- Parameterized complexity of generalized domination problems (Q415279) (← links)
- Colouring, constraint satisfaction, and complexity (Q458466) (← links)
- Confronting intractability via parameters (Q465686) (← links)
- Computing tree-depth faster than \(2^n\) (Q493242) (← links)
- How many \(F\)'s are there in \(G\)? (Q648970) (← links)
- Characterisations and examples of graph classes with bounded expansion (Q661943) (← links)
- Rank-width and tree-width of \(H\)-minor-free graphs (Q709231) (← links)
- LIFO-search: a min-max theorem and a searching game for cycle-rank and tree-depth (Q713301) (← links)
- Computing vertex-surjective homomorphisms to partially reflexive trees (Q714844) (← links)
- Gonality of expander graphs (Q724872) (← links)
- Sublinear separators, fragility and subexponential expansion (Q896068) (← links)
- On low tree-depth decompositions (Q897253) (← links)
- On forbidden subdivision characterizations of graph classes (Q925035) (← links)
- Small graph classes and bounded expansion (Q965245) (← links)
- Generalization of transitive fraternal augmentations for directed graphs and its applications (Q1043997) (← links)
- A surprising permanence of old motivations (a not-so-rigid story) (Q1045032) (← links)
- Characterising bounded expansion by neighbourhood complexity (Q1621072) (← links)
- Towards a characterization of universal categories (Q1684740) (← links)
- On classes of graphs with strongly sublinear separators (Q1750205) (← links)
- Hypertree-depth and minors in hypergraphs (Q1929221) (← links)
- From \(\chi\)- to \(\chi_p\)-bounded classes (Q2099414) (← links)
- Clustering powers of sparse graphs (Q2209886) (← links)
- Polynomial treedepth bounds in linear colorings (Q2223702) (← links)
- A note on sublinear separators and expansion (Q2225455) (← links)
- On the weak 2-coloring number of planar graphs (Q2237215) (← links)
- On the parameterized complexity of \([1,j]\)-domination problems (Q2283043) (← links)
- Structural sparsity of complex networks: bounded expansion in random models and real-world graphs (Q2316938) (← links)
- Grad and classes with bounded expansion. I: Decompositions (Q2426456) (← links)
- Grad and classes with bounded expansion. III: Restricted graph homomorphism dualities (Q2427548) (← links)
- On nowhere dense graphs (Q2430977) (← links)
- Distance-two coloring of sparse graphs (Q2441647) (← links)
- Strongly sublinear separators and polynomial expansion (Q2808163) (← links)
- Obstructions for tree-depth (Q2851471) (← links)
- Counting homomorphisms to sparse graphs (Q2851494) (← links)
- Many Facets of Dualities (Q2971613) (← links)
- Lossy Kernels for Connected Dominating Set on Sparse Graphs (Q3304128) (← links)
- Fraternal Augmentations of graphs, Coloration and Minors (Q3439588) (← links)
- Approximation Algorithms for Polynomial-Expansion and Low-Density Graphs (Q3452835) (← links)
- Layouts of Expander Graphs (Q3466402) (← links)
- Approximation Algorithms for Polynomial-Expansion and Low-Density Graphs (Q4593248) (← links)
- First order properties on nowhere dense structures (Q4931094) (← links)
- Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-wideness (Q4984870) (← links)
- Recovering sparse graphs (Q5005129) (← 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)
- EXISTENCE OF MODELING LIMITS FOR SEQUENCES OF SPARSE STRUCTURES (Q5222519) (← links)
