3 citations · 4 across the 2 of their papers we have counts for
4 papers
Properly colored cycles in edge-colored complete graphs containing no monochromatic triangles: a vertex-pancyclic analogous result
Ruonan Li
A properly colored cycle (path) in an edge-colored graph is a cycle (path) with consecutive edges assigned distinct colors. A monochromatic triangle is a cycle of length with t…
Rainbow triangles in arc-colored digraphs
Wei Li, Shenggui Zhang, Ruonan Li
Let be an arc-colored digraph. The arc number of is defined as the number of arcs of . The color number of is defined as the number of colors assigned…
Rainbow triangles in arc-colored tournaments
Wei Li, Shenggui Zhang, Yandong Bai +1
Let be an arc-colored tournament of order . The maximum monochromatic indegree (resp. outdegree ) of is the maximum number of…
Vertex-disjoint properly edge-colored cycles in edge-colored complete graphs
Ruonan Li, Hajo Broersma, Shenggui Zhang
It is conjectured that every edge-colored complete graph on vertices satisfying contains vertex-disjoint properly edge-colored cycles. We confir…