Proper Hamiltonian Paths in Edge-Coloured Multigraphs

Given a c-edge-coloured multigraph, where c is a positive integer, a proper Hamiltonian path is a path that contains all the vertices of the multigraph such that no two adjacent edges have the same colour. In this work we establish sufficient conditions for an edge-coloured multigraph to guarantee t...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Águeda, R., Borozan, V., Groshaus, M., Manoussakis, Y., Mendy, G., Montero, L.
Formato: JOUR
Materias:
Edge-coloured graph
Multigraph
Proper Hamiltonian path
Acceso en línea:http://hdl.handle.net/20.500.12110/paper_09110119_v33_n4_p617_Agueda
Aporte de:
Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) de Universidad de Buenos Aires

Ejemplares similares

Ejemplares similares