The fast search number of a Cartesian product of graphs

DOI10.1016/j.dam.2017.03.003zbMath1361.05114MaRDI QIDQ526821

Yuan Xue, Boting Yang

Publication date: 15 May 2017

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2017.03.003

zbMATH Keywords

graph searching; fast searching; Cops and Robber game

Mathematics Subject Classification ID

91A43: Games involving graphs

91A24: Positional games (pursuit and evasion, etc.)

05C57: Games on graphs (graph-theoretic aspects)

05C76: Graph operations (line graphs, products, etc.)

Related Items

On the Cooperative Graph Searching Problem, Fast searching on \(k\)-combinable graphs, Edge searching and fast searching with constraints, The fast search number of a complete \(k\)-partite graph, Fast searching on cactus graphs

Cites Work

• Fast-mixed searching and related problems on graphs
• Fast searching games on graphs
• Fast edge searching and fast searching on graphs
• The treewidth and pathwidth of hypercubes
• An annotated bibliography on guaranteed graph searching
• Searching and pebbling
• Three-fast-searchable graphs
• Fast Searching on Complete k-partite Graphs
• On the Fast Searching Problem
• Topological Bandwidth
• The complexity of searching a graph
• Monotonicity in graph searching
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item