𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A Construction of Uniquely C 4 -free colourable Graphs

✍ Scribed by Benadé, Gerhard; Broere, Izak; Brown, Jason I.

Book ID
118139610
Publisher
Taylor and Francis Group
Year
1990
Tongue
English
Weight
244 KB
Volume
13
Category
Article
ISSN
1607-3606

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A census of maximum uniquely hamiltonian
A census of maximum uniquely hamiltonian graphs
✍ Curtiss A. Barefoot; R. C. Entringer 📂 Article 📅 1981 🏛 John Wiley and Sons 🌐 English ⚖ 261 KB 👁 1 views

## Abstract We show that there are 2^[n/2]‐4^ largest graphs of order __n__ ≥ 7 having exactly one hamiltonian cycle. a recursive procedure for constructing these graphs is described.