The following pages link to On nowhere dense graphs (Q2430977):
Displaying 13 items.
- Enumeration for FO Queries over Nowhere Dense Graphs (Q5889796) (← links)
- On the generalised colouring numbers of graphs that exclude a fixed minor (Q5890918) (← links)
- On low rank-width colorings (Q5918207) (← links)
- Parameterized complexity of conflict-free set cover (Q5918356) (← links)
- Conflict free version of covering problems on graphs: classical and parameterized (Q5918906) (← links)
- On the generalised colouring numbers of graphs that exclude a fixed minor (Q5920084) (← links)
- Neighbourhood complexity of graphs of bounded twin-width (Q6081102) (← links)
- Modularity of minor‐free graphs (Q6094045) (← links)
- Hat Guessing Numbers of Strongly Degenerate Graphs (Q6161264) (← links)
- A color-avoiding approach to subgraph counting in bounded expansion classes (Q6174815) (← links)
- Counting subgraphs in somewhere dense graphs (Q6621747) (← links)
- On finding short reconfiguration sequences between independent sets (Q6627042) (← links)
- When locality meets preservation (Q6649481) (← links)