✦ LIBER ✦

Covering a chessboard with staircase walks

✍ Scribed by Ackerman, Eyal; Pinchasi, Rom

Book ID: 121244240
Publisher: Elsevier Science
Year: 2013
Tongue: English
Weight: 371 KB
Volume: 313
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2013.07.017

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A bound for the covering time of random

A bound for the covering time of random walks on graphs

✍ JoséLuis Palacios 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 199 KB

Counting paths on a chessboard with a ba

Counting paths on a chessboard with a barrier

✍ Marcellino Gaudenzi 📂 Article 📅 2010 🏛 Elsevier 🌐 English ⚖ 503 KB

How a random walk covers a finite lattic

How a random walk covers a finite lattice

✍ M.J.A.M. Brummelhuis; H.J. Hilhorst 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 435 KB

Replicative Helicases: A Staircase with

Replicative Helicases: A Staircase with a Twist

✍ Mark S. Dillingham 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 235 KB

Circle Covering With a Margin

✍ András Bezdek; Włodzimierz Kuperberg 📂 Article 📅 1997 🏛 Springer Netherlands 🌐 English ⚖ 519 KB

Covering a graph with cycles

✍ Hong Wang 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 444 KB

## Abstract Let __k__ and __n__ be two integers such that __k__ ≥ 0 and __n__ ≥ 3(__k__ + 1). Let __G__ be a graph of order __n__ with minimum degree at least ⌈(__n__ + __k__)/2⌉. Then __G__ contains __k__ + 1 independent cycles covering all the vertices of __G__ such that __k__ of them are triangl