𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Proofs as Graphs

✍ Scribed by Duncan Shand; Simon Brock

Publisher
Elsevier Science
Year
1995
Tongue
English
Weight
349 KB
Volume
2
Category
Article
ISSN
1571-0661

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A note on proofs with graphs
A note on proofs with graphs
✍ Renata de Freitas; Petrucio Viana πŸ“‚ Article πŸ“… 2008 πŸ› Elsevier Science 🌐 English βš– 312 KB
Proofs as processes
Proofs as processes
✍ Samson Abramsky πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 357 KB
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 , ...,