Fast Robber in Planar Graphs

DOI10.1007/978-3-540-92248-3_28zbMath1202.68286DBLPconf/wg/NisseS08OpenAlexW1602204928WikidataQ62046058 ScholiaQ62046058MaRDI QIDQ5302065

Karol Suchan, Nicolas Nisse

Publication date: 20 January 2009

Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-92248-3_28

zbMATH Keywords

minorsubdivisionplanar graphgridcops and robber

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Games on graphs (graph-theoretic aspects) (05C57)

Related Items (5)

Fast Robber in Planar Graphs ⋮ Catching a fast robber on the grid ⋮ Cops and robber on butterflies, grids, and AT-free graphs ⋮ Pursuing a fast robber on a graph ⋮ Cops, a fast robber and defensive domination on interval graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The complexity of pursuit on a graph
• A game of cops and robbers
• Note on a pursuit game played on graphs
• A short note about pursuit games played on a graph with a given genus
• Cops and robbers in graphs with large girth and Cayley graphs
• On a pursuit game played on graphs for which a minor is excluded
• Bridged graphs and geodesic convexity
• On bridged graphs and cop-win graphs
• A partial k-arboretum of graphs with bounded treewidth
• On the cop number of a graph
• Bridged graphs are cop-win graphs: An algorithmic proof
• Vertex-to-vertex pursuit in a graph
• A note on \(k\)-cop, \(l\)-robber games on graphs
• Fast Robber in Planar Graphs

This page was built for publication: Fast Robber in Planar Graphs