The problem of construction of a nonorientable triangular embedding of the graph K, -K 2, n -8(rood 12), n >/ 1, was posed in the course of the proof of the Map Colour Theorem, but it remained an open problem. In this paper the embedding is constructed.
✦ LIBER ✦
Triangular imbedding of Kn − K6
✍ Scribed by Richard K Guy; Gerhard Ringel
- Publisher
- Elsevier Science
- Year
- 1976
- Tongue
- English
- Weight
- 201 KB
- Volume
- 21
- Category
- Article
- ISSN
- 0095-8956
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
A nonorientable triangular embedding of
✍
Vladimir P. Korzhik
📂
Article
📅
1995
🏛
Elsevier Science
🌐
English
⚖ 548 KB
Triangular embeddings of Kn−Km with unbo
✍
Vladimir P. Korzhik
📂
Article
📅
1998
🏛
Elsevier Science
🌐
English
⚖ 569 KB
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
The genus of Kn − K2
✍
Mark Jungerman
📂
Article
📅
1975
🏛
Elsevier Science
🌐
English
⚖ 324 KB
Optimal packings of K4's into a Kn
✍
A.E. Brouwer
📂
Article
📅
1979
🏛
Elsevier Science
🌐
English
⚖ 957 KB
The complete spectrum of 6-cycle systems
✍
B. A. Cox
📂
Article
📅
1995
🏛
John Wiley and Sons
🌐
English
⚖ 533 KB
In this article, it is shown that a decomposition of the line graph of the complete graph on n vertices into cycles of length 6 exist if and only if n p 3 (mod 4).
Determination of NΛK coupling constant f
✍
M. Lusignoli; M. Restignoli; G.A. Snow; G. Violini
📂
Article
📅
1966
🏛
Elsevier Science
⚖ 238 KB