Contents

Ars Combinatoria

  • Research article

Properly Coloured Hamiltonian Paths in Edge-coloured Complete Graphs without Monochromatic Triangles

Olof Barr1
1Department of Mathematics UmedaUniversity S-901 87 Umea Sweden
  • Published: 31/12/1998

Abstract

We show that every complete graph \(K_n\), with an edge-colouring without monochromatic triangles, has a properly coloured Hamiltonian path.

Information
Guidelines
CP Initiatives
Follow CP
Facebook X-twitter Linkedin

1970-2025 CP (Manitoba, Canada) unless otherwise stated.

Citation
Olof Barr. Properly Coloured Hamiltonian Paths in Edge-coloured Complete Graphs without Monochromatic Triangles[J], Ars Combinatoria, Volume 050. 316-318. DOI: .