Proper hamiltonian paths in edge-coloured multigraphs

Águeda, Raquel; Borozan, Valentin; Groshaus, Marina Esther; Manoussakis, Yannis; Mendy, Gervais; Montero, Leandro

info:eu-repo/semantics/article

Fecha

2017-07

Registro en:

Águeda, Raquel; Borozan, Valentin; Groshaus, Marina Esther; Manoussakis, Yannis; Mendy, Gervais; et al.; Proper hamiltonian paths in edge-coloured multigraphs; Springer Tokyo; Graphs And Combinatorics; 33; 4; 7-2017; 617-633

0911-0119

http://hdl.handle.net/11336/163203

CONICET Digital

CONICET

https://repositorioslatinoamericanos.uchile.cl/handle/2250/4409272

Autor

Águeda, Raquel

Borozan, Valentin

Groshaus, Marina Esther

Manoussakis, Yannis

Mendy, Gervais

Montero, Leandro

Institución

Consejo Nacional de Investigaciones Científicas y Tecnológicas (Argentina)

Resumen

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.

Materias

EDGE-COLOURED GRAPH

MULTIGRAPH

PROPER HAMILTONIAN PATH

Mostrar el registro completo del ítem