Covering the complete graph with plane cycles

Alan Hartman, Yoav Medan

Research output: Contribution to journalArticlepeer-review


Let n vertices be distributed on the circumference of a circle in the plane. We find, for every n, the minimum number of cycles with no crossing edges such that every pair of vertices is adjacent on at least one cycle. The problem arises from the design of a train shuttle service between n cities with continuous guaranteed service at all times, and minimum number of rail lanes.

Original languageEnglish
Pages (from-to)305-310
Number of pages6
JournalDiscrete Applied Mathematics
Issue number1-3
StatePublished - 19 Jul 1993
Externally publishedYes

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Applied Mathematics


Dive into the research topics of 'Covering the complete graph with plane cycles'. Together they form a unique fingerprint.

Cite this