𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Generating Nonisomorphic Quadrangular Embeddings of a Complete Graph

✍ Scribed by Vladimir P. Korzhik

Book ID
115558808
Publisher
John Wiley and Sons
Year
2012
Tongue
English
Weight
807 KB
Volume
74
Category
Article
ISSN
0364-9024

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 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

Complete triangulations of a given order
Complete triangulations of a given order generated from a multitude of nonisomorphic cubic graphs by current assignments
✍ Vladimir P. Korzhik πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 248 KB

## Abstract It is known that for all sufficiently large __s__, there are at least \documentclass{article}\footskip=0pc\pagestyle{empty}\begin{document}$(\frac{5}{3})$\end{document}^2__s__^ nonequivalent graceful labellings of the path on 2__s__ + 1 vertices. Using this result, we construct exponent