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:	Groshaus, Marina E., Montero, Leandro P.
Publicado:	2017
Materias:	Edge-coloured graph Multigraph Proper Hamiltonian path
Acceso en línea:	https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_09110119_v33_n4_p617_Agueda 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	paper:paper_09110119_v33_n4_p617_Agueda
record_format	dspace
spelling	paper:paper_09110119_v33_n4_p617_Agueda2025-07-30T18:26:13Z Proper Hamiltonian Paths in Edge-Coloured Multigraphs Groshaus, Marina E. Montero, Leandro P. 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. 2017 https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_09110119_v33_n4_p617_Agueda 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 Groshaus, Marina E. Montero, Leandro P. 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.
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-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
publishDate	2017
url	https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_09110119_v33_n4_p617_Agueda http://hdl.handle.net/20.500.12110/paper_09110119_v33_n4_p617_Agueda
work_keys_str_mv	AT groshausmarinae properhamiltonianpathsinedgecolouredmultigraphs AT monteroleandrop properhamiltonianpathsinedgecolouredmultigraphs
_version_	1840325252129751040

Proper Hamiltonian Paths in Edge-Coloured Multigraphs

Ejemplares similares