Constrained graph searching on trees

DOI10.1007/978-3-031-39344-0_18zbMATH Open1547.68635MaRDI QIDQ6535820

Lusheng Wang, Zhaohui Zhan, Boting Yang

Publication date: 28 February 2024

zbMATH Keywords

treegraph searchingedge search numberfast search number

Mathematics Subject Classification ID

Games involving graphs (91A43) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fast searching games on graphs
• The fast search number of a Cartesian product of graphs
• Fast edge searching and fast searching on graphs
• An annotated bibliography on guaranteed graph searching
• The vertex separation number of a graph equals its path-width
• The vertex separation and search number of a graph
• The fast search number of a complete \(k\)-partite graph
• Three-fast-searchable graphs
• Fast searching on cactus graphs
• On the Fast Searching Problem
• Topological Bandwidth
• The complexity of searching a graph
• Monotonicity in graph searching
• Recontamination does not help to search a graph

This page was built for publication: Constrained graph searching on trees