1 citations · 1 across the 2 of their papers we have counts for
2 papers
math.CO2022
A revisit to Bang-Jensen-Gutin conjecture and Yeo's theorem
Ruonan Li, Bo Ning
A path (cycle) is properly-colored if consecutive edges are of distinct colors. In 1997, Bang-Jensen and Gutin conjectured a necessary and sufficient condition for the existence of…
math.CO2017★ 1 cited
Decomposing edge-colored graphs under color degree constraints
Ruonan Li, Shinya Fujita, Guanghui Wang
For an edge-colored graph , the minimum color degree of means the minimum number of colors on edges which are adjacent to each vertex of . We prove that if is an edge…