The following pages link to (Q2752024):
Displaying 8 items.
- \(k\)-chordal graphs: from cops and robber to compact routing via treewidth (Q494802) (← links)
- Greedy strategies and larger islands of tractability for conjunctive queries and constraint satisfaction problems (Q729822) (← links)
- Linguistic geometry approach for solving the cops and robber problem in grid environments (Q778399) (← links)
- An annotated bibliography on guaranteed graph searching (Q930895) (← links)
- Cops and robbers on intersection graphs (Q1645059) (← links)
- (Q5136239) (← links)
- Fast Robber in Planar Graphs (Q5302065) (← links)
- On the cop number of graphs of high girth (Q6093134) (← links)
