Null and non-rainbow colorings of projective plane and sphere triangulations

From MaRDI portal
(Redirected from Publication:299082)




Abstract: For maximal planar graphs of order ngeq4, we prove that a vertex--coloring containing no rainbow faces uses at most lfloorfrac2n13floor colors, and this is best possible. For maximal graph embedded on the projective plane, we obtain the analogous best bound lfloorfrac2n+13floor. The main ingredients in the proofs are classical homological tools. By considering graphs as topological spaces, we introduce the notion of a null coloring, and prove that for any graph G a maximal null coloring f is such that the quotient graph G/f is a forest.









This page was built for publication: Null and non-rainbow colorings of projective plane and sphere triangulations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q299082)