𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A note on frucht diagrams, boolean graphs and hamilton cycles

✍ Scribed by I.J. Dejter; W. Cedeño; V. Jauregui


Publisher
Elsevier Science
Year
1993
Tongue
English
Weight
527 KB
Volume
114
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.


📜 SIMILAR VOLUMES


A note on path and cycle decompositions
✍ Dom Decaen 📂 Article 📅 1981 🏛 John Wiley and Sons 🌐 English ⚖ 137 KB 👁 1 views

## Abstract In the study of decompositions of graphs into paths and cycles, the following questions have arisen: Is it true that every graph __G__ has a smallest path (resp. path‐cycle) decomposition __P__ such that every odd vertex of __G__ is the endpoint of exactly one path of __P__? This note g