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
id todo:paper_15710653_v38_n_p5_Agueda
record_format dspace
spelling todo:paper_15710653_v38_n_p5_Agueda2023-10-03T16:27:07Z Proper Hamiltonian Paths in Edge-Colored Multigraphs Águeda, R. Borozan, V. Groshaus, M. Manoussakis, Y. Mendy, G. Montero, L. Edge-Coloring Multigraph Proper Hamiltonian Path 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 sufficient conditions for a multigraph to have a proper hamiltonian path, depending on several parameters such as the number of edges, the rainbow degree, etc. © 2011 Elsevier B.V. Fil:Groshaus, M. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales; Argentina. Fil:Montero, L. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales; Argentina. JOUR info:eu-repo/semantics/openAccess http://creativecommons.org/licenses/by/2.5/ar http://hdl.handle.net/20.500.12110/paper_15710653_v38_n_p5_Agueda
institution Universidad de Buenos Aires
institution_str I-28
repository_str R-134
collection Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA)
topic Edge-Coloring
Multigraph
Proper Hamiltonian Path
spellingShingle Edge-Coloring
Multigraph
Proper Hamiltonian Path
Águeda, R.
Borozan, V.
Groshaus, M.
Manoussakis, Y.
Mendy, G.
Montero, L.
Proper Hamiltonian Paths in Edge-Colored Multigraphs
topic_facet Edge-Coloring
Multigraph
Proper Hamiltonian Path
description 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 sufficient conditions for a multigraph to have a proper hamiltonian path, depending on several parameters such as the number of edges, the rainbow degree, etc. © 2011 Elsevier B.V.
format JOUR
author Águeda, R.
Borozan, V.
Groshaus, M.
Manoussakis, Y.
Mendy, G.
Montero, L.
author_facet Águeda, R.
Borozan, V.
Groshaus, M.
Manoussakis, Y.
Mendy, G.
Montero, L.
author_sort Águeda, R.
title Proper Hamiltonian Paths in Edge-Colored Multigraphs
title_short Proper Hamiltonian Paths in Edge-Colored Multigraphs
title_full Proper Hamiltonian Paths in Edge-Colored Multigraphs
title_fullStr Proper Hamiltonian Paths in Edge-Colored Multigraphs
title_full_unstemmed Proper Hamiltonian Paths in Edge-Colored Multigraphs
title_sort proper hamiltonian paths in edge-colored multigraphs
url http://hdl.handle.net/20.500.12110/paper_15710653_v38_n_p5_Agueda
work_keys_str_mv AT aguedar properhamiltonianpathsinedgecoloredmultigraphs
AT borozanv properhamiltonianpathsinedgecoloredmultigraphs
AT groshausm properhamiltonianpathsinedgecoloredmultigraphs
AT manoussakisy properhamiltonianpathsinedgecoloredmultigraphs
AT mendyg properhamiltonianpathsinedgecoloredmultigraphs
AT monterol properhamiltonianpathsinedgecoloredmultigraphs
_version_ 1807318977780645888

Ejemplares similares