Back to Search
Start Over
A NOTE ON LONGEST PATHS IN CIRCULAR ARC GRAPHS.
- Source :
-
Discussiones Mathematicae: Graph Theory . 2015, Vol. 35 Issue 3, p419-419. 1p. - Publication Year :
- 2015
-
Abstract
- 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 in- tersection of all longest paths in a connected circular arc graph is nonempty. In this paper we close this gap. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 12343099
- Volume :
- 35
- Issue :
- 3
- Database :
- Academic Search Index
- Journal :
- Discussiones Mathematicae: Graph Theory
- Publication Type :
- Academic Journal
- Accession number :
- 108556366
- Full Text :
- https://doi.org/10.7151/dmgt.1800