Proper Hamiltonian Paths in Edge-Coloured Multigraphs

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...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Graphs and combinatorics 2017-07, Vol.33 (4), p.617-633
Hauptverfasser: Águeda, Raquel, Borozan, Valentin, Groshaus, Marina, Manoussakis, Yannis, Mendy, Gervais, Montero, Leandro
Format: Artikel
Sprache:eng
Schlagworte:
Combinatorics
Engineering Design
Mathematics
Mathematics and Statistics
Original Paper
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
ISSN:0911-0119
1435-5914
DOI:10.1007/s00373-017-1803-6