Properly coloured Hamiltonian paths in edge-coloured complete graphs

DOI10.1016/S0166-218X(97)00062-0MaRDI QIDQ1383382zbMATH OpenFDO

Authors A. Yeo, Jørgen Bang-Jensen, G. Gutin

Publication date 19 October 1998

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL http://www.elsevier.com/locate/dam

zbMATH Keywords

cycleedge-coloured complete graphsHamiltonian cycleHamiltonian pathpathproper edge colourings

Mathematics Subject Classification ID

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

Recommendations

• Properly coloured Hamiltonian cycles in edge-coloured complete graphs
• Characterization of edge-colored complete graphs with properly colored Hamilton paths
• Properly coloured Hamiltonian paths in edge-coloured complete graphs without monochromatic triangles
• scientific article; zbMATH DE number 1067836
• Hamilton circuits with many colours in properly edge-coloured complete graphs.
• Proper Hamiltonian cycles in edge-colored multigraphs
• Hamiltonian paths in Cayley color graphs

Cites work

• A property of the colored complete graph
• Alternating cycles and paths in edge-coloured multigraphs: A survey
• Alternating Hamiltonian cycles
• Graphs with Hamiltonian cycles having adjacent lines different colours
• Hamiltonian circuits determining the order of chromosomes
• scientific article; zbMATH DE number 4049453 (Why is no real title available?)
• scientific article; zbMATH DE number 1067836 (Why is no real title available?)
• scientific article; zbMATH DE number 762736 (Why is no real title available?)
• Properly coloured Hamiltonian paths in edge-coloured complete graphs without monochromatic triangles

Cited in

(16)

• Alternating cycles and paths in edge-coloured multigraphs: A survey
• Properly coloured Hamiltonian cycles in edge-coloured complete graphs
• Maximum properly colored trees in edge-colored graphs
• Optimal pathway reconstruction on 3D NMR maps
• Long properly colored cycles in edge colored complete graphs
• Proper vertex-pancyclicity of edge-colored complete graphs without joint monochromatic triangles
• Properly colored 2-factors of edge-colored complete bipartite graphs
• Properly coloured Hamiltonian paths in edge-coloured complete graphs without monochromatic triangles
• Characterization of edge-colored complete graphs with properly colored Hamilton paths
• Properly coloured cycles and paths: Results and open problems
• Comment on ``Properly coloured Hamiltonian paths in edge-coloured complete graphs without monochromatic triangles.
• Generating all invertible matrices by row operations
• Properly colored even cycles in edge-colored complete balanced bipartite graphs
• Properly colored cycles in edge-colored balanced bipartite graphs
• Generating all invertible matrices by row operations
• On a problem of G. Hahn about coloured Hamiltonian paths in \(K_{2n}\)

This page was built for publication: Properly coloured Hamiltonian paths in edge-coloured complete graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1383382)