Computing the one-visibility copnumber of trees

DOI10.1007/978-3-030-57602-8_37zbMath1482.05325OpenAlexW3047829504MaRDI QIDQ2039691

Tanzina Akter, Boting Yang

Publication date: 5 July 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-57602-8_37

zbMATH Keywords

linear-time algorithmzero-visibility copnumbers on trees

Mathematics Subject Classification ID

Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

A simple method for proving lower bounds in the zero-visibility cops and robber game

Cites Work

• Unnamed Item
• Unnamed Item
• The complexity of zero-visibility cops and robber
• Vertex-to-vertex pursuit in a graph
• Limited visibility cops and robber
• A partition approach to lower bounds for zero-visibility cops and robber
• Zero-visibility cops and robber and the pathwidth of a graph
• The complexity of searching a graph
• New results on the zero-visibility cops and robber game

This page was built for publication: Computing the one-visibility copnumber of trees