Journal of Graph Theory · 2014 · 42 citations · 4 references
Natural SciencesComputer ScienceMathematicsCombinatoricsComputational GeometryGeometryGraph ColoringGraph TheoryColoring Planar GraphsColoring TheoremsLower Bound ComputationTriangulation AlgorithmsTriangulation GraphsTriangulationsUpper Bound Computation
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 C 3 in any n ‐vertex plane triangulation is equal to . For a lower bound and for an upper bound of the number is determined.
4
Rainbow Numbers for Cycles with Pendant Edges
Izolda Gorgol · Graphs and Combinatorics · 2008 · 18 citations
Rainbow faces in edge‐colored plane graphs
Stanislav Jendrol′, J. Miškuf, Roman Soták et al. · Journal of Graph Theory · 2009 · 11 citations