Ein 7-Farbensatz 1-einbettbarer Graphen auf der projektiven Ebene (Q762173)

A coupled colouring of a map L on a surface S is a simultaneous colouring of the vertices and faces of L such that any two elements that are adjacent or incident are assigned different colours. Denote by \({\hat \chi}\)(L) the minimum number of colours needed for a coupled colouring of L. Further, let \({\hat \chi}\)(S) be the maximum of \({\hat \chi}\)(L) where L runs over all maps on the surface S. The coupled chromatic number \({\hat \chi}\) (for the sphere \(S_ 0)\) was studied first by \textit{G. Ringel} [Abh. Math. Semin. Univ. Hamb. 29, 107- 117 (1965; Zbl 0132.207)] where it is proved that \(6\leq {\hat \chi}(S_ 0)\leq 7;\) for a recent work on this topic see \textit{D. Archdeacon} [Congr. Numerantium 39, 89-93 (1983; Zbl 0544.05027)]. In the present paper, the author studies maps on \(N_ 1\), the projective plane, and proves that \({\hat \chi}\)(N\({}_ 1)=7\).