Properly coloured Hamiltonian paths in edge-coloured complete graphs without monochromatic triangles
An edge coloring of a graph is proper if no two edges of the same color have a common vertex. Main result: every complete graph \(K_n\) with an edge coloring without monochromatic triangles has a properly colored Hamiltonian path.
scientific article; zbMATH DE number 1602791