Title of article
Proper Hamiltonian Paths in Edge-Colored Multigraphs
Author/Authors
A. and ءgueda، نويسنده , , Raquel and Borozan، نويسنده , , Valentin and Groshaus، نويسنده , , Marina and Manoussakis، نويسنده , , Yannis and Mendy، نويسنده , , Gervais and Montero، نويسنده , , Leandro، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2011
Pages
6
From page
5
To page
10
Abstract
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.
Keywords
Multigraph , Proper Hamiltonian Path , Edge-coloring
Journal title
Electronic Notes in Discrete Mathematics
Serial Year
2011
Journal title
Electronic Notes in Discrete Mathematics
Record number
1455748
Link To Document