Rainbow Numbers for Cycles in Plane Triangulations
Mirko Horňák, Stanislav Jendrol′, Ingo Schiermeyer, Roman Soták · Journal of Graph Theory · 2014
Abstract In the article, the existence of rainbow cycles in edge colored plane triangulations is studied. It is shown that the minimum number of colors that force the existence of a rainbow C3 in any n‐vertex plane triangulation is equal to . For a lower bound and for an upper bound of the number is determined.