Computing the one-visibility copnumber of trees
type: Item
instance of: scholarly article
title: Computing the one-visibility copnumber of trees
zbMATH Open document ID: 1482.05325
DOI: 10.1007/978-3-030-57602-8_37
author: Boting Yang
author: Tanzina Akter
publication date: 2021-07-05T00:00:00Z
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 05C05
zbMATH DE Number: 7367777
zbMATH Keywords: linear-time algorithm
zbMATH Keywords: zero-visibility copnumbers on trees
MaRDI profile type: Publication
full work available at URL: 978-3-030-57602-8 37
OpenAlex ID: W3047829504
cites work: Q3090934
cites work: Limited visibility cops and robber
cites work: Zero-visibility cops and robber and the pathwidth of a graph
cites work: The complexity of zero-visibility cops and robber
cites work: The complexity of searching a graph
cites work: Vertex-to-vertex pursuit in a graph
cites work: Q4724424
cites work: New results on the zero-visibility cops and robber game
cites work: A partition approach to lower bounds for zero-visibility cops and robber
description: scientific article; zbMATH DE number 7367777