In this paper, we describe the generation of all nonorientable triangular embeddings of the complete graphs K 12 and K 13 . (The 59 nonisomorphic orientable triangular embeddings of K 12 were found in 1996 by Altshuler, Bokowski, and Schuchert, and K 13 has no orientable triangular embeddings.) Ther
✦ LIBER ✦
Triangular embeddings of Kn−Km with unboundedly large m
✍ Scribed by Vladimir P. Korzhik
- Publisher
- Elsevier Science
- Year
- 1998
- Tongue
- English
- Weight
- 569 KB
- Volume
- 190
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
✦ Synopsis
The author has proposed methods of constructing index 2 and 3 current graphs generating triangular embeddings of graphs Kn-Km with unboundedly large m (as n increases). As a result, triangular embeddings of graphs of many families of graphs K,-K,, with unboundedly large m were constructed. The paper gives a survey of these results and a short explanation of the methods.
📜 SIMILAR VOLUMES
Triangular embeddings of complete graphs
✍
M. N. Ellingham; Chris Stephens
📂
Article
📅
2005
🏛
John Wiley and Sons
🌐
English
⚖ 133 KB