Pages that link to "Item:Q419416"
From MaRDI portal
The following pages link to Sparsity. Graphs, structures, and algorithms (Q419416):
Displaying 50 items.
- On ultralimits of sparse graph classes (Q286118) (← links)
- First order convergence of matroids (Q326662) (← links)
- Short proofs of some extremal results. II. (Q326811) (← links)
- Kernelization using structural parameters on sparse graph classes (Q340583) (← links)
- Courcelle's theorem for triangulations (Q346450) (← links)
- Grid minors in damaged grids (Q405308) (← links)
- Colouring edges with many colours in cycles (Q462927) (← links)
- Decomposition of bounded degree graphs into \(C_4\)-free subgraphs (Q472402) (← links)
- Practical algorithms for MSO model-checking on tree-decomposable graphs (Q473216) (← links)
- Computing tree-depth faster than \(2^n\) (Q493242) (← links)
- Long induced paths in graphs (Q518170) (← links)
- Boxicity, poset dimension, and excluded minors (Q668021) (← links)
- Complexity of token swapping and its variants (Q722547) (← links)
- Directed width parameters and circumference of digraphs (Q730003) (← links)
- Rainbow independent sets on dense graph classes (Q831859) (← links)
- Fast recoloring of sparse graphs (Q896058) (← links)
- Sublinear separators, fragility and subexponential expansion (Q896068) (← links)
- First-order limits, an analytical perspective (Q896082) (← links)
- On low tree-depth decompositions (Q897253) (← links)
- Polynomial graph invariants from homomorphism numbers (Q906477) (← links)
- A class of highly symmetric graphs, symmetric cylindrical constructions and their spectra (Q1618225) (← links)
- Characterising bounded expansion by neighbourhood complexity (Q1621072) (← links)
- Induced and weak induced arboricities (Q1625812) (← links)
- Safe sets in graphs: graph classes and structural parameters (Q1631677) (← links)
- Chromatic numbers of exact distance graphs (Q1633747) (← links)
- Limits of schema mappings (Q1650918) (← links)
- Towards a characterization of universal categories (Q1684740) (← links)
- Polynomial expansion and sublinear separators (Q1686248) (← links)
- Induced subdivisions and bounded expansion (Q1686256) (← links)
- Majority coloring game (Q1727720) (← links)
- Track layouts, layered path decompositions, and leveled planarity (Q1739109) (← links)
- The complexity landscape of decompositional parameters for ILP (Q1749387) (← links)
- On classes of graphs with strongly sublinear separators (Q1750205) (← links)
- Algorithms parameterized by vertex cover and modular width, through potential maximal cliques (Q1751087) (← links)
- On 1-uniqueness and dense critical graphs for tree-depth (Q1752669) (← links)
- Anagram-free graph colouring (Q1753108) (← links)
- Parameterized complexity of length-bounded cuts and multicuts (Q1799212) (← links)
- On the complexity of broadcast domination and multipacking In digraphs (Q1979448) (← links)
- Finding temporal paths under waiting time constraints (Q1979453) (← links)
- Efficient enumeration of dominating sets for sparse graphs (Q1983139) (← links)
- Efficient enumeration of maximal \(k\)-degenerate induced subgraphs of a chordal graph (Q1985603) (← links)
- On the diameter of tree associahedra (Q1991427) (← links)
- A constant amortized time enumeration algorithm for independent sets in graphs with bounded clique number (Q2034408) (← links)
- Subexponential parameterized algorithms and kernelization on almost chordal graphs (Q2037110) (← links)
- Faster algorithms for counting subgraphs in sparse graphs (Q2041986) (← links)
- Notes on graph product structure theory (Q2058955) (← links)
- Twin-width and generalized coloring numbers (Q2065919) (← links)
- On the treewidth of Hanoi graphs (Q2077387) (← links)
- Diameter estimates for graph associahedra (Q2093260) (← links)
- Twin-width and polynomial kernels (Q2093574) (← links)
