𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Special embeddings of the complete graph

✍ Scribed by Gary Haggard

Publisher
Springer
Year
1972
Tongue
English
Weight
165 KB
Volume
8
Category
Article
ISSN
0001-9054

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Quadrangular embeddings of the complete
Quadrangular embeddings of the complete even k-partite graph
✍ Nora Hartsfield; Gerhard Ringel πŸ“‚ Article πŸ“… 1990 πŸ› Elsevier Science 🌐 English βš– 240 KB

The complete even k-partite graph K n,.n\* ,..., "\* is the complete k-partite graph where all the n,'s are even numbers. Orientable and nonorientable quadrangular embeddings are constructed for all these graphs.

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

Regular orientable embeddings of complet
Regular orientable embeddings of complete bipartite graphs
✍ Jin Ho Kwak; Young Soo Kwon πŸ“‚ Article πŸ“… 2005 πŸ› John Wiley and Sons 🌐 English βš– 199 KB

## Abstract In this paper, it will be shown that the isomorphism classes of regular orientable embeddings of the complete bipartite graph __K__~__n,n__~ are in one‐to‐one correspondence with the permutations on __n__ elements satisfying a given criterion, and the isomorphism classes of them are com

Self-dual embeddings of complete multipa
Self-dual embeddings of complete multipartite graphs
✍ Dan Archdeacon πŸ“‚ Article πŸ“… 1994 πŸ› John Wiley and Sons 🌐 English βš– 761 KB

## Abstract In this paper we examine self‐dual embeddings of complete multipartite graphs, focusing primarily on __K__~__m__(__n__)~ having __m__ parts each of size __n.__ If __m__ = 2, then __n__ must be even. If the embedding is on an orientable surface, then an Euler characteristic argument show