𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Orientable and nonorientable genus of the complete bipartite graph

✍ Scribed by André Bouchet

Publisher
Elsevier Science
Year
1978
Tongue
English
Weight
417 KB
Volume
24
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Blocks and the nonorientable genus of gr
Blocks and the nonorientable genus of graphs
✍ Saul Stahl; Lowell W. Beineke 📂 Article 📅 1977 🏛 John Wiley and Sons 🌐 English ⚖ 183 KB 👁 1 views

## Abstract Examples are given to show that the nonorientable genus of a graph is not additive over its blocks. A nonorientable analog for the Battle, Harary, Kodama, and Youngs Theorem is proved; this completely determines the nonorientable genus of a graph in terms of its blocks. It is also shown

Acyclic orientations of complete biparti
Acyclic orientations of complete bipartite graphs
✍ Douglas B. West 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 216 KB

For a complete bipartite graph, the number of dependent edges in an acyclic orientation can be any integer from n-1 to e, where n and e are the number of vertices and edges in the graph. ## Ke3,words: Bipartite graph; Acyclic orientation Ill combinatorics we often ask whether an integer parameter

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