𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Solitaire clobber on circulant graphs

✍ Scribed by Pará, Telma; Dantas, Simone; Gravier, Sylvain

Book ID
122278232
Publisher
Elsevier Science
Year
2014
Tongue
English
Weight
589 KB
Volume
329
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Peg solitaire on graphs
Peg solitaire on graphs
✍ Robert A. Beeler; D. Paul Hoilman 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 200 KB
On isomorphic factorizations of circulan
On isomorphic factorizations of circulant graphs
✍ Brian Alspach; Danny Dyer; Donald L. Kreher 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 112 KB

## Abstract We investigate the conjecture that every circulant graph __X__ admits a __k__‐isofactorization for every __k__ dividing |__E__(__X__)|. We obtain partial results with an emphasis on small values of __k__. © 2006 Wiley Periodicals, Inc. J Combin Designs 14: 406–414, 2006

On Ádám's conjecture for circulant graph
On Ádám's conjecture for circulant graphs
✍ Mikhail Muzychuk 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 643 KB

Adfim's (1967) conjecture formulates necessary and sufficient conditions for cyclic (circulant) graphs to be isomorphic. It is known that the conjecture fails if n is divisible by either 8 or by an odd square. On the other hand, it was shown in [?] that the conjecture is true for circulant graphs w