RT Journal Article
T1 Proper Hamiltonian cycles in edge-colored multigraphs
A1 Agueda, R.
A1 Borozan, V.
A1 Díaz Sánchez, Raquel
A1 Manoussakis, Y.
A1 Montero, L.
AB 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.
PB Elsevier
SN 0012-365X
YR 2017
FD 2017
LK https://hdl.handle.net/20.500.14352/17895
UL https://hdl.handle.net/20.500.14352/17895
LA eng
DS Docta Complutense
RD 4 abr 2025