Proper Hamiltonian Paths in Edge-Coloured Multigraphs
Given a $c$-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 Hami...
Gespeichert in:
| Hauptverfasser: | , , , , , |
|---|---|
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Zusammenfassung: | Given a $c$-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. |
|---|---|
| DOI: | 10.48550/arxiv.1406.5376 |