𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Nonorientable hamilton cycle embeddings of complete tripartite graphs

✍ Scribed by M.N. Ellingham; Justin Z. Schroeder

Book ID
113567611
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
224 KB
Volume
312
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On the number of triangular embeddings o
On the number of triangular embeddings of complete graphs and complete tripartite graphs
✍ M. J. Grannell; M. Knor πŸ“‚ Article πŸ“… 2011 πŸ› John Wiley and Sons 🌐 English βš– 159 KB

## Abstract We prove that for every prime number __p__ and odd __m__>1, as __s__β†’βˆž, there are at least __w__ face 2‐colorable triangular embeddings of __K__~__w, w, w__~, where __w__ = __m__Β·__p__^__s__^. For both orientable and nonorientable embeddings, this result implies that for infinitely many