✦ LIBER ✦
All 2-regular graphs consisting of 4-cycles are graceful
✍ Scribed by Jaromir Abrham; Anton Kotzig
- Publisher
- Elsevier Science
- Year
- 1994
- Tongue
- English
- Weight
- 871 KB
- Volume
- 135
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
✦ Synopsis
It is shown that the graph kc, (consisting of k 4-cycles) has an a-valuation (a stronger form of the graceful valuation) for every positive integer k # 3. The graph 3C, is known to be graceful but it does not have an a-valuation.