𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On bridged graphs and cop-win graphs

✍ Scribed by R.P Anstee; M Farber

Book ID
107884277
Publisher
Elsevier Science
Year
1988
Tongue
English
Weight
412 KB
Volume
44
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Bridged Graphs Are Cop-Win Graphs: An Al
Bridged Graphs Are Cop-Win Graphs: An Algorithmic Proof
✍ Victor Chepoi πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 150 KB

A graph is bridged if it contains no isometric cycles of length greater than three. Anstee and Farber established that bridged graphs are cop-win graphs. According to Nowakowski and Winkler and Quilliot, a graph is a cop-win graph if and only if its vertices admit a linear ordering v 1 , v 2 , ...,

On cop-win graphs
On cop-win graphs
✍ Geňa Hahn; FranΓ§ois Laviolette; Norbert Sauer; Robert E. Woodrow πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 157 KB
Large classes of infinite k-cop-win grap
Large classes of infinite k-cop-win graphs
✍ Anthony Bonato; Geňa Hahn; Claude Tardif πŸ“‚ Article πŸ“… 2010 πŸ› John Wiley and Sons 🌐 English βš– 104 KB πŸ‘ 1 views

While finite cop-win finite graphs possess a good structural characterization, none is known for infinite cop-win graphs. As evidence that such a characterization might not exist, we provide as large as possible classes of infinite graphs with finite cop number. More precisely, for each infinite car

Bridged graphs and geodesic convexity
Bridged graphs and geodesic convexity
✍ Martin Farber πŸ“‚ Article πŸ“… 1987 πŸ› Elsevier Science 🌐 English βš– 588 KB

A graph G is bridged if each cycle C of length at least four contains two vertices whose distance from each other in G is strictly less than that in C. The class of bridged graphs is an extension of the class of chordal (or triangulated) graphs which arises in the study of convexity in graphs. A se