𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Almost all cop-win graphs contain a universal vertex

✍ Scribed by Anthony Bonato; Graeme Kemkes; Paweł Prałat

Book ID
113567617
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
217 KB
Volume
312
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Almost All 3-Connected Graphs Contain a
Almost All 3-Connected Graphs Contain a Contractible Set of k Vertices
✍ Matthias Kriesell 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 223 KB

McCuaig and Ota conjectured that every sufficiently large 3-connected graph G contains a connected subgraph H on k vertices such that G&V(H) is 2-connected. We prove the weaker statement that every sufficiently large 3-connected graph G contains a not necessarily connected subgraph H on k vertices s