A nonorientable triangular embedding of Kn-K2, n=8 (mod 12)

Abstract The problem of construction of a nonorientable triangular embedding of the graph K n − K 2 , n ≡ 8 (mod 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.