Pages that link to "Item:Q2426456"
From MaRDI portal
The following pages link to Grad and classes with bounded expansion. I: Decompositions (Q2426456):
Displaying 50 items.
- List rankings and on-line list rankings of graphs (Q266945) (← links)
- Kernelization using structural parameters on sparse graph classes (Q340583) (← links)
- Adapted game colouring of graphs (Q412230) (← links)
- Forbidden graphs for tree-depth (Q412288) (← links)
- Parameterized complexity of generalized domination problems (Q415279) (← links)
- Colouring, constraint satisfaction, and complexity (Q458466) (← links)
- Colouring edges with many colours in cycles (Q462927) (← links)
- Confronting intractability via parameters (Q465686) (← links)
- Computing tree-depth faster than \(2^n\) (Q493242) (← links)
- Complexity of rainbow vertex connectivity problems for restricted graph classes (Q505435) (← links)
- How many \(F\)'s are there in \(G\)? (Q648970) (← links)
- Degenerate and star colorings of graphs on surfaces (Q661942) (← 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)
- Rainbow independent sets on dense graph classes (Q831859) (← links)
- Sublinear separators, fragility and subexponential expansion (Q896068) (← links)
- On low tree-depth decompositions (Q897253) (← links)
- Uniqueness and minimal obstructions for tree-depth (Q898117) (← links)
- Further hardness results on rainbow and strong rainbow connectivity (Q908308) (← links)
- On forbidden subdivision characterizations of graph classes (Q925035) (← links)
- Small graph classes and bounded expansion (Q965245) (← links)
- Colouring games on outerplanar graphs and trees (Q1025941) (← links)
- Fraternal augmentations, arrangeability and linear Ramsey numbers (Q1039442) (← 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)
- Chromatic numbers of exact distance graphs (Q1633747) (← links)
- Towards a characterization of universal categories (Q1684740) (← links)
- Reconfiguration in bounded bandwidth and tree-depth (Q1686224) (← links)
- Induced subdivisions and bounded expansion (Q1686256) (← links)
- On classes of graphs with strongly sublinear separators (Q1750205) (← links)
- On 1-uniqueness and dense critical graphs for tree-depth (Q1752669) (← links)
- Hypertree-depth and minors in hypergraphs (Q1929221) (← links)
- Polynomial bounds for centered colorings on proper minor-closed graph classes (Q1984513) (← links)
- From \(\chi\)- to \(\chi_p\)-bounded classes (Q2099414) (← links)
- Constant round distributed domination on graph classes with bounded expansion (Q2117740) (← links)
- Harmless sets in sparse classes (Q2169963) (← links)
- On coloring numbers of graph powers (Q2174571) (← links)
- Clustering powers of sparse graphs (Q2209886) (← links)
- Regular partitions of gentle graphs (Q2216929) (← 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)
- 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)
- The \(k\)-strong induced arboricity of a graph (Q2408964) (← links)
- Parameterized extension complexity of independent set and related problems (Q2413967) (← links)
