The following pages link to (Q2752024):
Displaying 16 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)
- On the cop number of toroidal graphs (Q1984519) (← links)
- Study of a combinatorial game in graphs through linear programming (Q1986957) (← links)
- Cops and robbers on directed and undirected abelian Cayley graphs (Q2048357) (← links)
- Meyniel extremal families of abelian Cayley graphs (Q2117525) (← links)
- The game of cops and robbers on directed graphs with forbidden subgraphs (Q2155657) (← links)
- Pursuing a fast robber on a graph (Q2268876) (← links)
- A proof of the Meyniel conjecture for abelian Cayley graphs (Q2279260) (← links)
- To satisfy impatient web surfers is hard (Q2437758) (← links)
- (Q5136239) (← links)
- Fast Robber in Planar Graphs (Q5302065) (← links)
- On the cop number of graphs of high girth (Q6093134) (← links)
