Tandem-win graphs

DOI10.1016/j.disc.2004.11.016zbMath1073.05060OpenAlexW2041356670MaRDI QIDQ2568474

Richard J. Nowakowski, Nancy E. Clarke

Publication date: 10 October 2005

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

Full work available at URL: https://doi.org/10.1016/j.disc.2004.11.016

zbMATH Keywords

gamepursuitcop

Mathematics Subject Classification ID

Games involving graphs (91A43) Structural characterization of families of graphs (05C75) Graph theory (05C99)

Related Items (11)

An Introduction to Lazy Cops and Robbers on Graphs ⋮ Limited visibility cops and robber ⋮ Characterizations of \(k\)-copwin graphs ⋮ Unnamed Item ⋮ Elimination schemes and lattices ⋮ An annotated bibliography on guaranteed graph searching ⋮ \(k\)-chordal graphs: from cops and robber to compact routing via treewidth ⋮ On distance-preserving elimination orderings in graphs: complexity and algorithms ⋮ The game of Cops and Robber on circulant graphs ⋮ A survey on the relationship between the game of cops and robbers and other game representations ⋮ A witness version of the cops and robber game

Cites Work

• A game of cops and robbers
• On bridged graphs and cop-win graphs
• Bridged graphs are cop-win graphs: An algorithmic proof
• On Distance-Preserving and Domination Elimination Orderings
• Graph Classes: A Survey
• Unnamed Item

This page was built for publication: Tandem-win graphs