Proper Hamiltonian Paths in Edge-Colored Multigraphs - Equipe : Graphes, Algorithmes et Combinatoire Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2013

Proper Hamiltonian Paths in Edge-Colored Multigraphs

Résumé

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.
Fichier principal
Vignette du fichier
paper_php_final.pdf (267.14 Ko) Télécharger le fichier
Origine : Accord explicite pour ce dépôt

Dates et versions

hal-00847916 , version 1 (24-07-2013)
hal-00847916 , version 2 (27-11-2013)
hal-00847916 , version 3 (20-06-2014)

Identifiants

  • HAL Id : hal-00847916 , version 1

Citer

Raquel Águeda, Valentin Borozan, Marina Groshaus, Yannis Manoussakis, Gervais Mendy, et al.. Proper Hamiltonian Paths in Edge-Colored Multigraphs. 2013. ⟨hal-00847916v1⟩
252 Consultations
512 Téléchargements

Partager

Gmail Facebook X LinkedIn More