✦ LIBER ✦

Orientable quadrilateral embeddings of products of graphs

✍ Scribed by Tomaž Pisanski

Publisher: Elsevier Science
Year: 1992
Tongue: English
Weight: 299 KB
Volume: 109
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(92)90291-m

No coin nor oath required. For personal study only.

✦ Synopsis

Pisanski, T

📜 SIMILAR VOLUMES

Quadrilateral embeddings of bipartite gr

Quadrilateral embeddings of bipartite graphs

✍ Ian Anderson 📂 Article 📅 1981 🏛 John Wiley and Sons 🌐 English ⚖ 304 KB

## Abstract Current graphs and a theorem of White are used to show the existence of almost complete regular bipartite graphs with quadrilateral embeddings conjectured by Pisanski. Decompositions of __K~n~__ and __K~n, n~__ into graphs with quadrilateral embeddings are discussed, and some thickness

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

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

Exponential Families of Non-isomorphic N

Exponential Families of Non-isomorphic Non-triangular Orientable Genus Embeddings of Complete Graphs

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

It is shown that for every i 2 f1; 2; . . . ; 11g=f3; 4; 7g the complete graph K 12sþi for s5dðiÞ 2 f1; 2; 3; 4g has at least hðiÞ4 s non-isomorphic orientable genus embeddings, where hðiÞ 2 1; 1 2 ; 1 4 ; 1 8

Embeddings of cartesian products of near

Embeddings of cartesian products of nearly bipartite graphs

✍ Bojan Mohar; Tomaž Pisanski; Arthur T. White 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 384 KB

## Abstract Surgical techniques are often effective in constructing genus embeddings of cartesian products of bipartite graphs. In this paper we present a general construction that is “close” to a genus embedding for cartesian products, where each factor is “close” to being bipartite. In specializi

Embeddings of graphs

✍ Carsten Thomassen 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 861 KB