Pages that link to "Item:Q419416"
From MaRDI portal
The following pages link to Sparsity. Graphs, structures, and algorithms (Q419416):
Displaying 50 items.
- Exact Distance Colouring in Trees (Q5219316) (← links)
- EXISTENCE OF MODELING LIMITS FOR SEQUENCES OF SPARSE STRUCTURES (Q5222519) (← links)
- An 𝐿^{𝑝} theory of sparse graph convergence I: Limits, sparse random graph models, and power law distributions (Q5227976) (← links)
- Fine-grained complexity for sparse graphs (Q5230293) (← links)
- Lossy Kernels for Connected Dominating Set on Sparse Graphs (Q5234662) (← links)
- Circumference and Pathwidth of Highly Connected Graphs (Q5265331) (← links)
- Large Independent Sets in Triangle-Free Planar Graphs (Q5270410) (← links)
- Structural Properties of Sparse Graphs (Q5301017) (← links)
- Erdös--Hajnal Properties for Powers of Sparse Graphs (Q5857003) (← links)
- (Q5874519) (← links)
- Clustered colouring of graph classes with bounded treedepth or pathwidth (Q5885188) (← links)
- Counting Subgraphs in Degenerate Graphs (Q5889797) (← links)
- Temporal graph classes: a view through temporal separators (Q5915590) (← links)
- Feedback edge sets in temporal graphs (Q5918410) (← links)
- Distributed distance-\(r\) covering problems on sparse high-girth graphs (Q5918492) (← links)
- Exploring the gap between treedepth and vertex cover through vertex integrity (Q5918674) (← links)
- Conflict free version of covering problems on graphs: classical and parameterized (Q5918906) (← links)
- Subgraph isomorphism on graph classes that exclude a substructure (Q5919029) (← links)
- Harmonious and achromatic colorings of fragmentable hypergraphs (Q5920082) (← links)
- On the generalised colouring numbers of graphs that exclude a fixed minor (Q5920084) (← links)
- Distributed distance-\(r\) covering problems on sparse high-girth graphs (Q5925671) (← links)
- Exploring the gap between treedepth and vertex cover through vertex integrity (Q5925679) (← links)
- A distributed low tree-depth decomposition algorithm for bounded expansion classes (Q5964897) (← links)
- Characterising graphs with no subdivision of a wheel of bounded diameter (Q6038576) (← links)
- Proper orientations and proper chromatic number (Q6038578) (← links)
- 2-distance, injective, and exact square list-coloring of planar graphs with maximum degree 4 (Q6041534) (← links)
- Competitive Online Search Trees on Trees (Q6051990) (← links)
- Finding Temporal Paths Under Waiting Time Constraints. (Q6065432) (← links)
- Proper conflict-free list-coloring, odd minors, subdivisions, and layered treewidth (Q6080127) (← links)
- Book embeddings of \(k\)-framed graphs and \(k\)-map graphs (Q6080147) (← links)
- Neighbourhood complexity of graphs of bounded twin-width (Q6081102) (← links)
- (Q6089655) (← links)
- Parameterized Complexity of Geodetic Set (Q6089667) (← links)
- Parameterized Complexity of Graph Burning (Q6089668) (← links)
- (Q6089684) (← links)
- The PACE 2020 Parameterized Algorithms and Computational Experiments Challenge: Treedepth. (Q6089686) (← links)
- Shallow Minors, Graph Products, and Beyond-Planar Graphs (Q6130539) (← links)
- Grouped domination parameterized by vertex cover, twin cover, and beyond (Q6131196) (← links)
- Lacon-, Shrub- and Parity-Decompositions: Characterizing Transductions of Bounded Expansion Classes (Q6135763) (← links)
- SAT backdoors: depth beats size (Q6152185) (← links)
- Beyond symmetry in generalized Petersen graphs (Q6152224) (← links)
- CSP beyond tractable constraint languages (Q6154179) (← links)
- Grid recognition: classical and parameterized computational perspectives (Q6156159) (← links)
- Hat Guessing Numbers of Strongly Degenerate Graphs (Q6161264) (← links)
- Kontsevich Graphons (Q6166503) (← links)
- Graph product structure for non-minor-closed classes (Q6170788) (← links)
- A color-avoiding approach to subgraph counting in bounded expansion classes (Q6174815) (← links)
- Multi-priority graph sparsification (Q6182885) (← links)
- Sparse graphs without long induced paths (Q6196152) (← links)
- Asymptotic behavior of Markov complexity (Q6199053) (← links)