Proper Hamiltonian Cycles in Edge-Colored Multigraphs
Discrete Mathematics
2017-02-14 v6 Combinatorics
Abstract
A -edge-colored multigraph has each edge colored with one of the available colors and no two parallel edges have the same color. A proper Hamiltonian cycle is a cycle 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 cycle, depending on several parameters such as the number of edges and the rainbow degree.
Keywords
Cite
@article{arxiv.1411.5240,
title = {Proper Hamiltonian Cycles in Edge-Colored Multigraphs},
author = {Raquel Águeda and Valentin Borozan and Raquel Díaz and Yannis Manoussakis and Leandro Montero},
journal= {arXiv preprint arXiv:1411.5240},
year = {2017}
}
Comments
13 pages