Hostname: page-component-cd9895bd7-jkksz Total loading time: 0 Render date: 2024-12-28T00:26:54.711Z 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)
Get access Rights & Permissions [Opens in a new window]

Abstract

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

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

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)