Pages that link to "Item:Q2493118"
From MaRDI portal
The following pages link to Tree-depth, subgraph coloring and homomorphism bounds (Q2493118):
Displayed 50 items.
- List rankings and on-line list rankings of graphs (Q266945) (← links)
- Tree-depth and vertex-minors (Q281932) (← links)
- Thue choosability of trees (Q411845) (← links)
- Forbidden graphs for tree-depth (Q412288) (← links)
- Colouring, constraint satisfaction, and complexity (Q458466) (← links)
- Colouring edges with many colours in cycles (Q462927) (← links)
- Practical algorithms for MSO model-checking on tree-decomposable graphs (Q473216) (← 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)
- LIFO-search: a min-max theorem and a searching game for cycle-rank and tree-depth (Q713301) (← links)
- Complexity of planar signed graph homomorphisms to cycles (Q777377) (← links)
- Homomorphisms and edge-colourings of planar graphs (Q875942) (← links)
- On low tree-depth decompositions (Q897253) (← links)
- Uniqueness and minimal obstructions for tree-depth (Q898117) (← links)
- Polynomial graph invariants from homomorphism numbers (Q906477) (← links)
- Nonrepetitive colorings of graphs -- a survey (Q925326) (← links)
- Colouring games on outerplanar graphs and trees (Q1025941) (← links)
- A surprising permanence of old motivations (a not-so-rigid story) (Q1045032) (← links)
- Colouring graphs with bounded generalized colouring number (Q1045038) (← links)
- On the complexity of \(H\)-colouring planar graphs (Q1045065) (← links)
- Homomorphisms of triangle-free graphs without a \(K_{5}\)-minor (Q1045075) (← links)
- Chromatic numbers of exact distance graphs (Q1633747) (← links)
- Reconfiguration in bounded bandwidth and tree-depth (Q1686224) (← links)
- On 1-uniqueness and dense critical graphs for tree-depth (Q1752669) (← links)
- Parameterized complexity of length-bounded cuts and multicuts (Q1799212) (← links)
- Hypertree-depth and minors in hypergraphs (Q1929221) (← links)
- Polynomial bounds for centered colorings on proper minor-closed graph classes (Q1984513) (← links)
- Obstructions for bounded shrub-depth and rank-depth (Q2033913) (← links)
- Structurally parameterized \(d\)-scattered set (Q2064293) (← links)
- Colored cut games (Q2087453) (← links)
- From \(\chi\)- to \(\chi_p\)-bounded classes (Q2099414) (← links)
- A polynomial excluded-minor approximation of treedepth (Q2119392) (← links)
- On Dasgupta's hierarchical clustering objective and its relation to other graph parameters (Q2140508) (← links)
- Distance from triviality 2.0: hybrid parameterizations (Q2169932) (← links)
- \(2\times n\) grids have unbounded anagram-free chromatic number (Q2170797) (← links)
- Clustering powers of sparse graphs (Q2209886) (← links)
- Regular partitions of gentle graphs (Q2216929) (← links)
- How to compute digraph width measures on directed co-graphs (Q2220888) (← 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)
- Whither semantics? (Q2286732) (← links)
- A tight lower bound for vertex planarization on graphs of bounded treewidth (Q2403808) (← links)
- The \(k\)-strong induced arboricity of a graph (Q2408964) (← links)
- Space saving by dynamic algebraization based on tree-depth (Q2411033) (← links)
- Structural parameters, tight bounds, and approximation for \((k, r)\)-center (Q2422740) (← links)
- Grad and classes with bounded expansion. I: Decompositions (Q2426456) (← links)
- Grad and classes with bounded expansion. II: Algorithmic aspects (Q2426457) (← links)
- Grad and classes with bounded expansion. III: Restricted graph homomorphism dualities (Q2427548) (← links)
- On nowhere dense graphs (Q2430977) (← links)