Proper Hamiltonian paths in edge-coloured multigraphs

DOI10.1007/s00373-017-1803-6zbMath1371.05148arXiv1406.5376OpenAlexW2296604407MaRDI QIDQ2409503

Valentin Borozan, Gervais Mendy, Leandro Montero, Raquel Águeda, Yannis Manoussakis, Marina Groshaus

Publication date: 11 October 2017

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1406.5376

zbMATH Keywords

multigraphedge-coloured graphproper Hamiltonian path

Mathematics Subject Classification ID

Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Eulerian and Hamiltonian graphs (05C45)

Related Items (1)

Proper Hamiltonian cycles in edge-colored multigraphs

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
• Cycles and paths in edge‐colored graphs with given degrees
• Characterization of edge-colored complete graphs with properly colored Hamilton paths
• Properly Coloured Cycles and Paths: Results and Open Problems
• Graph folding and programmable logic array
• Hamiltonian problems in edge-colored complete graphs and eulerian cycles in edge-colored graphs : some complexity results

This page was built for publication: Proper Hamiltonian paths in edge-coloured multigraphs