## 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
✦ LIBER ✦
Complete bipartite graphs with a unique regular embedding
✍ Scribed by Gareth Jones; Roman Nedela; Martin Škoviera
- Book ID
- 108167417
- Publisher
- Elsevier Science
- Year
- 2008
- Tongue
- English
- Weight
- 137 KB
- Volume
- 98
- Category
- Article
- ISSN
- 0095-8956
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
Regular orientable embeddings of complet
✍
Jin Ho Kwak; Young Soo Kwon
📂
Article
📅
2005
🏛
John Wiley and Sons
🌐
English
⚖ 199 KB
Classification of reflexible regular emb
✍
Jin Ho Kwak; Young Soo Kwon
📂
Article
📅
2008
🏛
Elsevier Science
🌐
English
⚖ 206 KB
Self-dual embeddings of complete biparti
✍
Dan Archdeacon; Nora Hartsfield
📂
Article
📅
1992
🏛
Elsevier Science
🌐
English
⚖ 439 KB
The chromatic uniqueness of complete bip
✍
Shaoji Xu
📂
Article
📅
1991
🏛
Elsevier Science
🌐
English
⚖ 585 KB
Xu, S., The chromatic uniqueness of complete bipartite graphs, Discrete Mathematics 94 (1991) 153-159. This paper is partitioned into two parts. In the first part we determine the maximum number of induced complete bipartite subgraphs in graphs with some given conditions. Using a theorem given in th
Dispersed points and geometric embedding
✍
Hiroshi Maehara
📂
Article
📅
1991
🏛
Springer
🌐
English
⚖ 441 KB
Bipartite regular graphs with fixed diam
✍
H. J. Broersma; F. Göbel
📂
Article
📅
1995
🏛
John Wiley and Sons
🌐
English
⚖ 420 KB