Pages that link to "Item:Q419416"
From MaRDI portal
The following pages link to Sparsity. Graphs, structures, and algorithms (Q419416):
Displaying 50 items.
- On the treewidth of Hanoi graphs (Q2077387) (← links)
- Diameter estimates for graph associahedra (Q2093260) (← links)
- Twin-width and polynomial kernels (Q2093574) (← links)
- Excluding a ladder (Q2095109) (← links)
- Local planar domination revisited (Q2097345) (← links)
- From \(\chi\)- to \(\chi_p\)-bounded classes (Q2099414) (← links)
- Local certification of graphs with bounded genus (Q2104916) (← links)
- On monoid graphs (Q2112028) (← links)
- Fine-grained parameterized complexity analysis of graph coloring problems (Q2112649) (← links)
- A tight analysis of geometric local search (Q2117344) (← links)
- Parameterized complexity of \((A,\ell)\)-path packing (Q2118381) (← links)
- A polynomial excluded-minor approximation of treedepth (Q2119392) (← links)
- Preprocessing vertex-deletion problems: characterizing graph properties by low-rank adjacencies (Q2119402) (← links)
- Smaller extended formulations for spanning tree polytopes in minor-closed classes and beyond (Q2121739) (← links)
- Parameterized complexity of finding subgraphs with hereditary properties on hereditary graph classes (Q2140500) (← links)
- Graph theory -- a survey on the occasion of the Abel Prize for László Lovász (Q2143333) (← links)
- On structural parameterizations of the offensive alliance problem (Q2150581) (← links)
- Stack-number is not bounded by queue-number (Q2151179) (← links)
- The complexity of vector partition (Q2155634) (← links)
- Parameterized complexity of graph burning (Q2161013) (← links)
- Eccentricity queries and beyond using hub labels (Q2166770) (← links)
- Exact square coloring of certain classes of graphs: complexity and algorithms (Q2172606) (← links)
- Parameterized complexity of fair deletion problems (Q2174554) (← links)
- On quasi-planar graphs: clique-width and logical description (Q2174559) (← links)
- On coloring numbers of graph powers (Q2174571) (← links)
- Edge degeneracy: algorithmic and structural results (Q2196572) (← links)
- Treetopes and their graphs (Q2197683) (← links)
- Sparsity measure of a network graph: Gini index (Q2198225) (← links)
- Polynomial kernels for hitting forbidden minors under structural parameterizations (Q2202024) (← links)
- On fractional fragility rates of graph classes (Q2205120) (← links)
- Parameterized algorithms for book embedding problems (Q2206870) (← links)
- Clustering powers of sparse graphs (Q2209886) (← links)
- The power of linear-time data reduction for maximum matching (Q2211355) (← links)
- Regular partitions of gentle graphs (Q2216929) (← links)
- On structural parameterizations of the bounded-degree vertex deletion problem (Q2223699) (← links)
- Polynomial treedepth bounds in linear colorings (Q2223702) (← links)
- Branch-depth: generalizing tree-depth of graphs (Q2225398) (← 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)
- A note on sublinear separators and expansion (Q2225455) (← links)
- On the weak 2-coloring number of planar graphs (Q2237215) (← links)
- Turing kernelization for finding long paths in graph classes excluding a topological minor (Q2272596) (← links)
- On the parameterized complexity of \([1,j]\)-domination problems (Q2283043) (← links)
- Width, depth, and space: tradeoffs between branching and dynamic programming (Q2287480) (← links)
- Exact distance graphs of product graphs (Q2287747) (← links)
- Colouring exact distance graphs of chordal graphs (Q2305897) (← links)
- Structural sparsity of complex networks: bounded expansion in random models and real-world graphs (Q2316938) (← links)
- \(H\)-colouring \(P_t\)-free graphs in subexponential time (Q2322884) (← links)
- How much does a treedepth modulator help to obtain polynomial kernels beyond sparse graphs? (Q2324243) (← links)
- Strict superstablity and decidability of certain generic graphs (Q2332364) (← links)
