Cop-win graphs with maximum capture-time
type: Item
instance of: scholarly article
title: Cop-win graphs with maximum capture-time
zbMATH Open document ID: 1186.91051
author: Tomáš Gavenčiak
published in: Discrete Mathematics
publication date: 2010-05-05T00:00:00Z
Mathematics Subject Classification ID: 91A43
Mathematics Subject Classification ID: 91A05
Mathematics Subject Classification ID: 91A24
zbMATH DE Number: 5703958
zbMATH Keywords: combinatorial game theory
zbMATH Keywords: cop and robber games
zbMATH Keywords: capture-time
MaRDI profile type: Publication
full work available at URL: j.disc.2010.01.015
OpenAlex ID: W2063843010
cites work: Q3418339
cites work: Tarski's fixpoint lemma and combinatorial games
cites work: The capture time of a graph
cites work: An annotated bibliography on guaranteed graph searching
cites work: A note on \(k\)-cop, \(l\)-robber games on graphs
cites work: Q3671211
cites work: Vertex-to-vertex pursuit in a graph
DOI: 10.1016/J.DISC.2010.01.015
description: scientific article; zbMATH DE number 5703958