Null and non–rainbow colorings of maximal planar graphs

https://doi.org/10.1016/j.endm.2013.10.019Get rights and content

Abstract

For maximal planar graphs of order n4, we prove that a vertex–coloring containing no rainbow faces uses at most 2n13 colors, and this is best possible. The main ingredients in the proof 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.

References (7)

There are more references available in the full text version of this article.

Cited by (0)

1

Research supported by PAPIIT IA102013

View full text