Proper Hamiltonian Paths in Edge-Coloured Multigraphs
Discrete Mathematics
2014-06-23 v1 Combinatorics
Abstract
Given a -edge-coloured multigraph, 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 as the number of edges, the number of colours, the rainbow degree and the connectivity.
Keywords
Cite
@article{arxiv.1406.5376,
title = {Proper Hamiltonian Paths in Edge-Coloured Multigraphs},
author = {Raquel Águeda and Valentin Borozan and Marina Groshaus and Yannis Manoussakis and Gervais Mendy and Leandro Montero},
journal= {arXiv preprint arXiv:1406.5376},
year = {2014}
}
Comments
21 pages