Properly coloured Hamiltonian paths in edge-coloured complete graphs
From MaRDI portal
Publication:1383382
DOI10.1016/S0166-218X(97)00062-0zbMath0897.05037MaRDI QIDQ1383382
Anders Yeo, Jörgen Bang-Jensen, Gregory 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
cycle; path; Hamiltonian cycle; Hamiltonian path; edge-coloured complete graphs; proper edge colourings
Related Items
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
Cites Work
- Alternating Hamiltonian cycles
- A property of the colored complete graph
- Hamiltonian circuits determining the order of chromosomes
- Alternating cycles and paths in edge-coloured multigraphs: A survey
- Graphs with Hamiltonian cycles having adjacent lines different colours
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item