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: Groshaus, Marina E., Montero, Leandro P.
Publicado: 2011
Materias:
Edge-Coloring
Multigraph
Proper Hamiltonian Path
Acceso en línea:https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_15710653_v38_n_p5_Agueda
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 paper:paper_15710653_v38_n_p5_Agueda
record_format dspace
spelling paper:paper_15710653_v38_n_p5_Agueda2025-07-30T19:00:06Z Proper Hamiltonian Paths in Edge-Colored Multigraphs Groshaus, Marina E. Montero, Leandro P. 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. 2011 https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_15710653_v38_n_p5_Agueda 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
Groshaus, Marina E.
Montero, Leandro P.
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.
author Groshaus, Marina E.
Montero, Leandro P.
author_facet Groshaus, Marina E.
Montero, Leandro P.
author_sort Groshaus, Marina E.
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
publishDate 2011
url https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_15710653_v38_n_p5_Agueda
http://hdl.handle.net/20.500.12110/paper_15710653_v38_n_p5_Agueda
work_keys_str_mv AT groshausmarinae properhamiltonianpathsinedgecoloredmultigraphs
AT monteroleandrop properhamiltonianpathsinedgecoloredmultigraphs
_version_ 1840326359377772544

Ejemplares similares