
AbstractIn an edge-colored graph, let dc(v) be the number of colors on the edges incident to v and let δc(G) be the minimum dc(v) over all vertices v∈G. In this work, we consider sharp conditions on δc(G) which imply the existence of properly edge-colored paths and cycles, meaning no two consecutive edges have the same color.
Properly colored paths, Applied Mathematics, Properly colored cycles, Discrete Mathematics and Combinatorics, Edge-colored graphs, Mathematics, Education
Properly colored paths, Applied Mathematics, Properly colored cycles, Discrete Mathematics and Combinatorics, Edge-colored graphs, Mathematics, Education
| citations This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 42 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Top 10% | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
