Agueda, R.Borozan, V.Díaz Sánchez, RaquelManoussakis, Y.Montero, L.2023-06-172023-06-1720170012-365X10.1016/j.disc.2017.03.013https://hdl.handle.net/20.500.14352/17895A c-edge-colored multigraph has each edge colored with one of the c available colors and no two parallel edges have the same color. A proper Hamiltonian cycle is a cycle containing all the vertices of the multigraph such that no two adjacent edges have the same color. In this work we establish sufficient conditions for a multigraph to have a proper Hamiltonian cycle, depending on several parameters such as the number of edges and the rainbow degree.engjournal articlehttp://www.sciencedirect.com/science/article/pii/S0012365X17300936http://www.sciencedirect.com/restricted access514MultigraphProper Hamiltonian cycleEdge-colored graphGeometría1204 Geometría