Pages that link to "Item:Q4640289"
From MaRDI portal
The following pages link to Deciding First-Order Properties of Nowhere Dense Graphs (Q4640289):
Displaying 41 items.
- Reducing CMSO model checking to highly connected graphs (Q5002822) (← links)
- (Q5005129) (← links)
- Diameter, Eccentricities and Distance Oracle Computations on <i>H</i>-Minor Free Graphs and Graphs of Bounded (Distance) Vapnik–Chervonenkis Dimension (Q5048290) (← links)
- Elimination Distance to Bounded Degree on Planar Graphs (Q5089238) (← links)
- (Q5090476) (← links)
- (Q5090497) (← links)
- Uniformly Automatic Classes of Finite Structures (Q5090943) (← links)
- On the Parameterized Complexity of [1,j]-Domination Problems (Q5090974) (← links)
- (Q5091010) (← links)
- (Q5091136) (← links)
- (Q5092394) (← links)
- (Q5092402) (← links)
- (Q5094135) (← links)
- (Q5109514) (← links)
- (Q5111296) (← links)
- (Q5111878) (← links)
- Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-Wideness (Q5140724) (← links)
- Successor-Invariant First-Order Logic on Classes of Bounded Degree (Q5145657) (← links)
- EXISTENCE OF MODELING LIMITS FOR SEQUENCES OF SPARSE STRUCTURES (Q5222519) (← links)
- Lossy Kernels for Connected Dominating Set on Sparse Graphs (Q5234662) (← links)
- (Q5259542) (redirect page) (← links)
- Erdös--Hajnal Properties for Powers of Sparse Graphs (Q5857003) (← links)
- Improved Hardness of Maximum Common Subgraph Problems on Labeled Graphs of Bounded Treewidth and Bounded Degree (Q5859738) (← links)
- First-Order Model-Checking in Random Graphs and Complex Networks (Q5874510) (← links)
- (Q5874521) (← links)
- Enumeration for FO Queries over Nowhere Dense Graphs (Q5889796) (← links)
- On the generalised colouring numbers of graphs that exclude a fixed minor (Q5890918) (← links)
- Faster Existential FO Model Checking on Posets (Q5892117) (← links)
- On low rank-width colorings (Q5918207) (← links)
- On the generalised colouring numbers of graphs that exclude a fixed minor (Q5920084) (← links)
- A distributed low tree-depth decomposition algorithm for bounded expansion classes (Q5964897) (← links)
- (Q6065417) (← links)
- Maximum Shallow Clique Minors in Preferential Attachment Graphs Have Polylogarithmic Size (Q6084357) (← links)
- Parameterized Complexity of Graph Burning (Q6089668) (← links)
- (Q6089671) (← links)
- Computing dense and sparse subgraphs of weakly closed graphs (Q6107896) (← 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)
- A meta-theorem for distributed certification (Q6182681) (← links)
