Hostname: page-component-74656f9884-2dmjx Total loading time: 0 Render date: 2026-11-07T14:59:27.039Z Has data issue: false hasContentIssue false
  • English
  • Français

Longest Paths in Circular Arc Graphs

Published online by Cambridge University Press:  28 April 2004

PAUL N. BALISTER ,
ERVIN GYÖRI ,
JENÖ LEHEL  and
RICHARD H. SCHELP
PAUL N. BALISTER
Affiliation:
Department of Mathematical Sciences, University of Memphis, Memphis, TN 38152, USA (e-mail: balistep@msci.memphis.edu)
ERVIN GYÖRI
Affiliation:
Rényi Institute of Mathematics, Hungarian Academy of Sciences, H-1364 Budapest, Hungary (e-mail: gyori@renyi.hu)
JENÖ LEHEL
Affiliation:
Department of Mathematical Sciences, University of Memphis, Memphis, TN 38152, USA (e-mail: jlehel@memphis.edu)
RICHARD H. SCHELP
Affiliation:
Department of Mathematical Sciences, University of Memphis, Memphis, TN 38152, USA (e-mail: schelpr@msci.memphis.edu)
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

We show that all maximum length paths in a connected circular arc graph have non-empty intersection.

Information

Type
Paper
Information
Combinatorics, Probability and Computing , Volume 13 , Issue 3 , May 2004 , pp. 311 - 317
Copyright
2004 Cambridge University Press