Proper Hamiltonian cycles in edge-colored multigraphs
From MaRDI portal
Publication:2397532
DOI10.1016/j.disc.2017.03.013zbMath1362.05077arXiv1411.5240OpenAlexW2963715273MaRDI QIDQ2397532
Leandro Montero, Raquel Águeda, Valentin Borozan, Yannis Manoussakis, Raquel Díaz
Publication date: 22 May 2017
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1411.5240
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Edge bounds in nonhamiltonian \(k\)-connected graphs
- Alternating cycles and paths in edge-coloured multigraphs: A survey
- Proper Hamiltonian paths in edge-coloured multigraphs
- Cycles and paths in edge‐colored graphs with given degrees
- Characterization of edge-colored complete graphs with properly colored Hamilton paths
- Hamiltonian problems in edge-colored complete graphs and eulerian cycles in edge-colored graphs : some complexity results