Currently displaying 1 – 1 of 1

Showing per page

Order by Relevance | Title | Year of publication

A Note on Longest Paths in Circular Arc Graphs

Felix Joos — 2015

Discussiones Mathematicae Graph Theory

As observed by Rautenbach and Sereni [SIAM J. Discrete Math. 28 (2014) 335-341] there is a gap in the proof of the theorem of Balister et al. [Combin. Probab. Comput. 13 (2004) 311-317], which states that the intersection of all longest paths in a connected circular arc graph is nonempty. In this paper we close this gap.

Page 1

Download Results (CSV)