The following pages link to Excluding a group-labelled graph (Q2519025):
Displaying 6 items.
- Space complexity of reachability testing in labelled graphs (Q2316928) (← links)
- When does a biased graph come from a group labelling? (Q2406538) (← links)
- A Faster Parameterized Algorithm for Group Feedback Edge Set (Q3181064) (← links)
- Space Complexity of Reachability Testing in Labelled Graphs (Q5739010) (← links)
- Packing cycles in undirected group-labelled graphs (Q6038589) (← links)
- A unified half‐integral Erdős–Pósa theorem for cycles in graphs labelled by multiple abelian groups (Q6199337) (← links)
