𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Minimum Covering for Hexagon Triple Systems

✍ Scribed by Selda Kücçükcçİfcçİ; C. C. Lindner

Book ID
111579091
Publisher
Springer
Year
2004
Tongue
English
Weight
148 KB
Volume
32
Category
Article
ISSN
0925-1022

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Perfect hexagon triple systems
Perfect hexagon triple systems
✍ Selda Küçükçifçi; C.C Lindner 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 323 KB

The graph consisting of the three 3-cycles (a; b; c), (c; d; e), and (e; f; a), where a; b; c; d; e, and f are distinct is called a hexagon triple. The 3-cycle (a; c; e) is called an "inside" 3-cycle; and the 3-cycles (a; b; c), (c; d; e), and (e; f; a) are called "outside" 3-cycles. A 3k-fold hexag

The Doyen—Wilson theorem for minimum cov
The Doyen—Wilson theorem for minimum coverings with triples
✍ H. L. Fu; C. C. Lindner; C. A. Rodger 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 197 KB 👁 1 views

In this article necessary and sufficient conditions are found for a minimum covering of Km with triples to be embedded in a minimum covering of Kn with triples.

Minimum Covering Ellipses
Minimum Covering Ellipses
✍ Silverman, B. W.; Titterington, D. M. 📂 Article 📅 1980 🏛 Society for Industrial and Applied Mathematics ⚖ 1015 KB