Properly coloured Hamiltonian paths in edge-coloured complete graphs without monochromatic triangles
type: Item
instance of: scholarly article
zbMATH Open document ID: 0963.05051
author: Olof Barr
publication date: 2001-06-10T00:00:00Z
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C45
zbMATH DE Number: 1602791
zbMATH Keywords: proper coloring
zbMATH Keywords: properly colored Hamiltonian path
MaRDI profile type: Publication
title: Properly coloured Hamiltonian paths in edge-coloured complete graphs without monochromatic triangles
published in: Ars Combinatoria
review text: 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.
reviewed by: Zdeněk Ryjáček
description: scientific article; zbMATH DE number 1602791