On a problem of G. Hahn about coloured Hamiltonian paths in \(K_{2n}\)

DOI10.1016/0012-365X(84)90073-6zbMath0549.05044OpenAlexW2081545512MaRDI QIDQ800377

Henri Meyniel, Malaz Maamoun

Publication date: 1984

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

Full work available at URL: https://doi.org/10.1016/0012-365x(84)90073-6

zbMATH Keywords

edge coloringHamiltonian path

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55)

Related Items (21)

Polychromatic cliques ⋮ Path and cycle sub-Ramsey numbers and an edge-colouring conjecture ⋮ Rainbow spanning trees in abelian groups ⋮ Almost all optimally coloured complete graphs contain a rainbow Hamilton path ⋮ Random subgraphs of properly edge-coloured complete graphs and long rainbow cycles ⋮ Long directed rainbow cycles and rainbow spanning trees ⋮ Hamilton transversals in random Latin squares ⋮ Edge-disjoint rainbow trees in properly coloured complete graphs ⋮ Long rainbow paths and rainbow cycles in edge colored graphs. A survey ⋮ Unnamed Item ⋮ Rainbow structures in locally bounded colorings of graphs ⋮ A Rainbow Dirac's Theorem ⋮ Embedding rainbow trees with applications to graph labelling and decomposition ⋮ Rainbow vertex-pancyclicity of strongly edge-colored graphs ⋮ Decompositions into isomorphic rainbow spanning trees ⋮ Rainbow Hamiltonian cycles in strongly edge-colored graphs ⋮ On the rainbow Turán number of paths ⋮ Rainbow Turán problems for paths and forests of stars ⋮ Linearly many rainbow trees in properly edge-coloured complete graphs ⋮ On Hamiltonian Berge cycles in [3-uniform hypergraphs] ⋮ Lower bounds for rainbow Tur\'{a}n numbers of paths and other trees

Cites Work

• Unnamed Item

This page was built for publication: On a problem of G. Hahn about coloured Hamiltonian paths in \(K_{2n}\)