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
id todo:paper_09110119_v33_n4_p617_Agueda
record_format dspace
spelling todo:paper_09110119_v33_n4_p617_Agueda2023-10-03T15:44:38Z Proper Hamiltonian Paths in Edge-Coloured Multigraphs Águeda, R. Borozan, V. Groshaus, M. Manoussakis, Y. Mendy, G. Montero, L. Edge-coloured graph Multigraph Proper Hamiltonian path 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 the existence of a proper Hamiltonian path, involving various parameters such as the number of edges, the number of colours, the rainbow degree and the connectivity. © 2017, Springer Japan. 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_09110119_v33_n4_p617_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-coloured graph
Multigraph
Proper Hamiltonian path
spellingShingle Edge-coloured graph
Multigraph
Proper Hamiltonian path
Águeda, R.
Borozan, V.
Groshaus, M.
Manoussakis, Y.
Mendy, G.
Montero, L.
Proper Hamiltonian Paths in Edge-Coloured Multigraphs
topic_facet Edge-coloured graph
Multigraph
Proper Hamiltonian path
description 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 the existence of a proper Hamiltonian path, involving various parameters such as the number of edges, the number of colours, the rainbow degree and the connectivity. © 2017, Springer Japan.
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-Coloured Multigraphs
title_short Proper Hamiltonian Paths in Edge-Coloured Multigraphs
title_full Proper Hamiltonian Paths in Edge-Coloured Multigraphs
title_fullStr Proper Hamiltonian Paths in Edge-Coloured Multigraphs
title_full_unstemmed Proper Hamiltonian Paths in Edge-Coloured Multigraphs
title_sort proper hamiltonian paths in edge-coloured multigraphs
url http://hdl.handle.net/20.500.12110/paper_09110119_v33_n4_p617_Agueda
work_keys_str_mv AT aguedar properhamiltonianpathsinedgecolouredmultigraphs
AT borozanv properhamiltonianpathsinedgecolouredmultigraphs
AT groshausm properhamiltonianpathsinedgecolouredmultigraphs
AT manoussakisy properhamiltonianpathsinedgecolouredmultigraphs
AT mendyg properhamiltonianpathsinedgecolouredmultigraphs
AT monterol properhamiltonianpathsinedgecolouredmultigraphs
_version_ 1807322232431575040

Ejemplares similares