Hamilton circuits with many colours in properly edge-coloured complete graphs.

DOI10.7146/math.scand.a-12245zbMath0665.05028OpenAlexW1663876857MaRDI QIDQ3816096

Lars Døvling Andersen

Publication date: 1989

Published in: MATHEMATICA SCANDINAVICA (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/186120

zbMATH Keywords

Latin squarestransversalsHamilton circuitedge-colourings

Mathematics Subject Classification ID

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

Related Items

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 ⋮ Long rainbow cycles and Hamiltonian cycles using many colors in properly edge-colored complete graphs ⋮ Long rainbow paths and rainbow cycles in edge colored graphs. A survey ⋮ A rainbow blow‐up lemma ⋮ Rainbow structures in locally bounded colorings of graphs ⋮ Embedding rainbow trees with applications to graph labelling and decomposition ⋮ Rainbow Turán problems for paths and forests of stars ⋮ Rainbow Cycles in Flip Graphs ⋮ Finding a Longest Alternating Cycle in a 2-edge-coloured Complete Graph is in RP ⋮ Rainbow Cycles in Flip Graphs. ⋮ Symmetric latin square and complete graph analogues of the evans conjecture