Naga Ayachitula, Melissa Buco, et al.
SCC 2007
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. © 1993.
Naga Ayachitula, Melissa Buco, et al.
SCC 2007
Ligang Lu, Jack L. Kouloheris
IS&T/SPIE Electronic Imaging 2002
M. Tismenetsky
International Journal of Computer Mathematics
Simeon Furrer, Dirk Dahlhaus
ISIT 2005