Proper Hamiltonian Paths in Edge-Colored Multigraphs

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 path is a path containing all the vertices of the multigraph such that no two adjacent edges have the same color. In this work we establish suffici...

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-Coloring
Multigraph
Proper Hamiltonian Path
Acceso en línea:http://hdl.handle.net/20.500.12110/paper_15710653_v38_n_p5_Agueda
Aporte de:
Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) de Universidad de Buenos Aires

Ejemplares similares

Ejemplares similares