On cop-win graphs (Q1850039)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On cop-win graphs |
scientific article; zbMATH DE number 1839020
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On cop-win graphs |
scientific article; zbMATH DE number 1839020 |
Statements
On cop-win graphs (English)
0 references
2 December 2002
0 references
This paper investigates the possibility whether all bridged graphs are cop-win or not. It is shown that infinite chordal graphs, even of diameter two, need not be cop-win. It is also shown that there is no bound on the length of a game in terms of the diameter of the graph. The existence of chordal graphs of diameter two that are not cop-win by compactness has also been proved. The paper concludes with some interesting questions and open problems.
0 references
bridged graphs
0 references
chordal graphs
0 references
diameter
0 references
