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.
|Number of pages||6|
|Journal||Discrete Applied Mathematics|
|State||Published - 19 Jul 1993|
ASJC Scopus subject areas
- Discrete Mathematics and Combinatorics
- Applied Mathematics