B. Nagle

collaborators

2 papers

math.CO2019

On Even Rainbow or Nontriangular Directed Cycles

Andrzej Czygrinow, Theodore Molla, Brendan Nagle +1

Let $G = (V, E)$ be an $n$ -vertex edge-colored graph. In 2013, H. Li proved that if every vertex $v \in V$ is incident to at least $(n + 1) /2$ distinctly colored edges, then $G$ admi…

math.CO2019

On Odd Rainbow Cycles in Edge-Colored Graphs

Andrzej Czygrinow, Theodore Molla, Brendan Nagle +1

Let $G = (V, E)$ be an $n$ -vertex edge-colored graph. In 2013, H. Li proved that if every vertex $v \in V$ is incident to at least $(n + 1) /2$ distinctly colored edges, then $G$ admi…