✦ LIBER ✦

Knots in spatial embeddings of the complete graph on four vertices

✍ Scribed by Makoto Yamamoto

Publisher: Elsevier Science
Year: 1990
Tongue: English
Weight: 421 KB
Volume: 36
Category: Article
ISSN: 0166-8641
DOI: 10.1016/0166-8641(90)90053-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Packing and covering of the complete gra

Packing and covering of the complete graph with a graph G of four vertices or less

✍ Y Roditty 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 551 KB

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

On the Number of Nonisomorphic Orientabl

On the Number of Nonisomorphic Orientable Regular Embeddings of Complete Graphs

✍ Vladimir P. Korzhik; Heinz-Jurgen Voss 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 260 KB

In this paper we consider those 2-cell orientable embeddings of a complete graph K n+1 which are generated by rotation schemes on an abelian group 8 of order n+1, where a rotation scheme an 8 is defined as a cyclic permutation ( ; 1 , ; 2 , ..., ; n ) of all nonzero elements of 8. It is shown that t

On labeling the vertices of products of

On labeling the vertices of products of complete graphs with distance constraints

✍ D.J. Erwin; J.P. Georges; D.W. Mauro 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 71 KB

On the number of vertices of given degre

On the number of vertices of given degree in a random graph

✍ Zbigniew Palka 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 115 KB 👁 1 views

This note can be treated a s a supplement to a paper written by Bollobas which was devoted to the vertices of a given degree in a random graph. We determine some values of the edge probability p for which the number of vertices of a given degree of a random graph G E ?An, p) asymptotically has a nor

On the Connectivity of Graphs Embedded i

On the Connectivity of Graphs Embedded in Surfaces

✍ Michael D Plummer; Xiaoya Zha 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 376 KB

In a 1973 paper, Cooke obtained an upper bound on the possible connectivity of a graph embedded in a surface (orientable or nonorientable) of fixed genus. Furthermore, he claimed that for each orientable genus #>0 (respectively, nonorientable genus #Ä >0, #Ä {2) there is a complete graph of orientab