Rainbow Numbers for Cycles in Plane Triangulations |
| |
| Authors: | Mirko Horňák Stanislav Jendrol′ Ingo Schiermeyer Roman Soták |
| |
| Institution: | 1. INSTITUTE OF MATHEMATICS, P. J. ?AFáRIK UNIVERSITY KO?ICE, SLOVAKIA;2. INSTITUT FüR DISKRETE MATHEMATIK UND ALGEBRA, TECHNISCHE UNIVERSIT?T BERGAKADEMIE FREIBERG FREIBERG, GERMANY |
| |
| 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. |
| |
| Keywords: | edge coloring rainbow number rainbow subgraph triangulation |
|
