𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The Number of Embeddings of Minimally Rigid Graphs

✍ Scribed by Ciprian Borcea; Ileana Streinu

Book ID
106149509
Publisher
Springer
Year
2004
Tongue
English
Weight
241 KB
Volume
31
Category
Article
ISSN
0179-5376

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

Embeddings of graphs
Embeddings of graphs
✍ Carsten Thomassen πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 861 KB
Bounding the number of embeddings of 5-c
Bounding the number of embeddings of 5-connected projective-planar graphs
✍ Shigeru Kitakubo πŸ“‚ Article πŸ“… 1991 πŸ› John Wiley and Sons 🌐 English βš– 268 KB

A graph is said to be projective-planar if it is nonplanar and is embeddable in a projective plane. In this paper we show that the numbers of projectiveplanar embeddings (up to equivalence) of all 5-connected graphs have an upper bound c( 1120).

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