×

Longest paths in circular arc graphs. (English) Zbl 1051.05053

It is shown that all maximum length paths of a connected circular arc graph, or a connected interval graph, have non-empty intersection.

MSC:

05C38 Paths and cycles
PDF BibTeX XML Cite
Full Text: DOI