Pages that link to "Item:Q1101027"

The following pages link to On a pursuit game played on graphs for which a minor is excluded (Q1101027):

Displaying 44 items.

• An evasion game on a graph (Q383337) (← links)
• \(k\)-chordal graphs: from cops and robber to compact routing via treewidth (Q494802) (← links)
• Guard games on graphs: keep the intruder out! (Q650877) (← links)
• The complexity of pursuit on a graph (Q673639) (← links)
• An extension of a fixed point problem for simple graphs (Q686510) (← links)
• Note on a pursuit game played on graphs (Q799702) (← links)
• An annotated bibliography on guaranteed graph searching (Q930895) (← links)
• A short note about pursuit games played on a graph with a given genus (Q1072462) (← links)
• On a pursuit game on Cayley graphs (Q1090336) (← links)
• Cops and robbers in graphs with large girth and Cayley graphs (Q1092060) (← links)
• On a pursuit game on Cayley digraphs (Q1100216) (← links)
• Simplicial decompositions of graphs: A survey of applications (Q1118617) (← links)
• Some pursuit-evasion problems on grids (Q1199947) (← links)
• A two-person game on graphs where each player tries to encircle his opponent's men (Q1285593) (← links)
• On the cop number of a graph (Q1325748) (← links)
• Helicopter search problems, bandwidth and pathwidth (Q1392549) (← links)
• A game of cops and robbers played on products of graphs (Q1584265) (← links)
• Game of cops and robbers in oriented quotients of the integer grid (Q1685996) (← links)
• On a characterization of evasion strategies for pursuit-evasion games on graphs (Q1686676) (← links)
• The cat and the noisy mouse (Q1699546) (← links)
• On a game of policemen and robber (Q1820799) (← links)
• On the cop number of toroidal graphs (Q1984519) (← links)
• 4-cop-win graphs have at least 19 vertices (Q2032980) (← links)
• Guarding a subgraph as a tool in pursuit-evasion games (Q2062677) (← links)
• A tight lower bound for the capture time of the cops and robbers game (Q2196569) (← links)
• The one-cop-moves game on graphs with some special structures (Q2210510) (← links)
• Cops and robbers on \(2K_2\)-free graphs (Q2237234) (← links)
• Pursuing a fast robber on a graph (Q2268876) (← links)
• A survey on the relationship between the game of cops and robbers and other game representations (Q2280205) (← links)
• To satisfy impatient web surfers is hard (Q2437758) (← links)
• A note on the cops and robber game on graphs embedded in non-orientable surfaces (Q2441345) (← links)
• On a pursuit-evasion model without instantaneous movement (Q2800793) (← links)
• Variations on cops and robbers (Q2891049) (← links)
• On Meyniel's conjecture of the cop number (Q2911063) (← links)
• Metric Embedding via Shortest Path Decompositions (Q5071090) (← links)
• Cops, Robbers, and Threatening Skeletons: Padded Decomposition for Minor-Free Graphs (Q5232322) (← links)
• Fast Robber in Planar Graphs (Q5302065) (← links)
• On the generalised colouring numbers of graphs that exclude a fixed minor (Q5890918) (← links)
• On the generalised colouring numbers of graphs that exclude a fixed minor (Q5920084) (← links)
• On the cop number of graphs of high girth (Q6093134) (← links)
• Cops and Robbers on \(\boldsymbol{P_5}\)-Free Graphs (Q6195949) (← links)
• Bounding the cop number of a graph by its genus (Q6621170) (← links)
• Pursuit-evasion in graphs: zombies, lazy zombies and a survivor (Q6635086) (← links)
• Improved bounds on the cop number when forbidding a minor (Q6667593) (← links)