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

From MaRDI portal
Publication:299082

DOI10.1016/J.DAM.2015.04.007zbMATH Open1339.05106arXiv1210.6831OpenAlexW1513441663MaRDI QIDQ299082FDOQ299082


Authors: Amanda Montejano, Jorge L. Arocha Edit this on Wikidata


Publication date: 22 June 2016

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/1210.6831




Recommendations




Cites Work


Cited In (1)





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)