Ein 7-Farbensatz 1-einbettbarer Graphen auf der projektiven Ebene
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\).
- Die Minimalbasis der Menge aller nicht in die projektive Ebene einbettbaren Graphen.
- Ein Sechsfarbenproblem auf der Kugel
- scientific article; zbMATH DE number 3013040 (Why is no real title available?)
- scientific article; zbMATH DE number 3450230 (Why is no real title available?)
- Zur Minimalstruktur der nicht in die projektive Ebene einbettbaren Graphen.
- On cyclic colorings and their generalizations
- A tighter bounding interval for the 1-chromatic number of a surface
- An infinite series of surfaces with known 1-chromatic number
- A possibly infinite series of surfaces with known 1-chromatic number
- Acyclic \(k\)-strong coloring of maps on surfaces
- 1-embeddability of complete multipartite graphs on the projective plane
- A note on the upper bounds on the size of bipartite and tripartite 1-embeddable graphs on surfaces
- scientific article; zbMATH DE number 3865308 (Why is no real title available?)
- scientific article; zbMATH DE number 3900784 (Why is no real title available?)
- On drawings and decompositions of 1-planar graphs
- On the 1-chromatic number of nonorientable surfaces with large genus
- 1-planarity of complete multipartite graphs
- scientific article; zbMATH DE number 932605 (Why is no real title available?)
- Finite fields and the 1‐chromatic number of orientable surfaces
- On restricted matching extension of 1-embeddable graphs in surfaces with small genus
- Re-1-embeddings of optimal 1-embedded graphs on the projective plane
- The vertex-face chromatic number of almost all nonorientable surfaces
- Coloring vertices and faces of maps on surfaces
- Coloring vertices and faces of locally planar graphs
This page was built for publication: Ein 7-Farbensatz 1-einbettbarer Graphen auf der projektiven Ebene
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q762173)
