Proper Hamiltonian cycles in edge-colored multigraphs
From MaRDI portal
Publication:2397532
DOI10.1016/J.DISC.2017.03.013zbMATH Open1362.05077arXiv1411.5240OpenAlexW2963715273MaRDI QIDQ2397532FDOQ2397532
Leandro Montero, R. Águeda, V. Borozan, Y. Manoussakis, Raquel Díaz
Publication date: 22 May 2017
Published in: Discrete Mathematics (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1411.5240
Recommendations
- Proper Hamiltonian paths in edge-colored multigraphs
- Proper Hamiltonian paths in edge-colored multigraphs
- Cycles and paths in edge‐colored graphs with given degrees
- Long rainbow cycles and Hamiltonian cycles using many colors in properly edge-colored complete graphs
- Multicolored parallelisms of Hamiltonian cycles
Cites Work
- Title not available (Why is that?)
- Hamiltonian problems in edge-colored complete graphs and eulerian cycles in edge-colored graphs : some complexity results
- Title not available (Why is that?)
- Alternating cycles and paths in edge-coloured multigraphs: A survey
- Cycles and paths in edge‐colored graphs with given degrees
- Characterization of edge-colored complete graphs with properly colored Hamilton paths
- Edge bounds in nonhamiltonian \(k\)-connected graphs
- Title not available (Why is that?)
- Proper Hamiltonian paths in edge-colored multigraphs
Cited In (3)
This page was built for publication: Proper Hamiltonian cycles in edge-colored multigraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2397532)
