Pages that link to "Item:Q2335907"

The following pages link to Topological directions in cops and robbers (Q2335907):

Displaying 12 items.

• On the cop number of toroidal graphs (Q1984519) (← links)
• 4-cop-win graphs have at least 19 vertices (Q2032980) (← links)
• The game of cops and eternal robbers (Q2034413) (← links)
• A simple method for proving lower bounds in the zero-visibility cops and robber game (Q2156313) (← links)
• Bounding the Cop Number of a Graph by Its Genus (Q5163511) (← links)
• Cops and robber on some families of oriented graphs (Q5896831) (← links)
• The node cop‐win reliability of unicyclic and bicyclic graphs (Q6065860) (← links)
• The localization number of designs (Q6188118) (← links)
• Guarding isometric subgraphs and cops and robber in planar graphs (Q6563993) (← links)
• Improved bounds on the cop number of a graph drawn on a surface (Q6604681) (← links)
• Cops and robbers on 1-planar graphs (Q6618244) (← links)
• Improved bounds on the cop number when forbidding a minor (Q6667593) (← links)