%0 Journal Article
%A Agueda, R.
%A Borozan, V.
%A Díaz Sánchez, Raquel
%A Manoussakis, Y.
%A Montero, L.
%T Proper Hamiltonian cycles in edge-colored multigraphs
%D 2017
%@ 0012-365X
%U https://hdl.handle.net/20.500.14352/17895
%X A 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.
%~