2026-06-30T14:20:32Zhttps://docta.ucm.es/rest/oai/request

oai:docta.ucm.es:20.500.14352/178952023-08-28T07:13:55Zcom_20.500.14352_14col_20.500.14352_15

Proper Hamiltonian cycles in edge-colored multigraphs Agueda, R. Borozan, V. Díaz Sánchez, Raquel Manoussakis, Y. Montero, L. 514 Multigraph Proper Hamiltonian cycle Edge-colored graph Geometría 1204 Geometría 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. Depto. de Álgebra, Geometría y Topología Fac. de Ciencias Matemáticas TRUE pub 2023-06-17T21:59:20Z 2023-06-17T21:59:20Z 2017 journal article https://hdl.handle.net/20.500.14352/17895 0012-365X 10.1016/j.disc.2017.03.013 eng restricted access application/pdf application/pdf Elsevier