AN EDGE-COLORED VERSION OF DIRAC'S THEOREM

作者：Lo Allan^*

来源：SIAM Journal on Discrete Mathematics, 2014, 28(1): 18-36.

DOI：10.1137/120903750

• proper edge-coloring
• 2-factor
• Hamiltonian cycle

Let G be an edge-colored graph. The minimum color degree delta(c)(G) of G is the largest integer k such that for every vertex v, there are at least k distinct colors on edges incident to v. We say that G is properly colored if no two adjacent edges have the same color. In this paper, we show t

• 出版日期2014