A Note on Longest Paths in Circular Arc Graphs
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 pa...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
University of Zielona Góra
2015-08-01
|
| Series: | Discussiones Mathematicae Graph Theory |
| Subjects: | |
| Online Access: | https://doi.org/10.7151/dmgt.1800 |
| _version_ | 1797757742391230464 |
|---|---|
| author | Joos Felix |
| author_facet | Joos Felix |
| author_sort | Joos Felix |
| collection | DOAJ |
| description | 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. |
| first_indexed | 2024-03-12T18:19:57Z |
| format | Article |
| id | doaj.art-35882f9e67384b13a8c906d8f145d93c |
| institution | Directory Open Access Journal |
| issn | 2083-5892 |
| language | English |
| last_indexed | 2024-03-12T18:19:57Z |
| publishDate | 2015-08-01 |
| publisher | University of Zielona Góra |
| record_format | Article |
| series | Discussiones Mathematicae Graph Theory |
| spelling | doaj.art-35882f9e67384b13a8c906d8f145d93c2023-08-02T08:59:10ZengUniversity of Zielona GóraDiscussiones Mathematicae Graph Theory2083-58922015-08-0135341942610.7151/dmgt.1800dmgt.1800A Note on Longest Paths in Circular Arc GraphsJoos Felix0Institut für Optimierung und Operations Research Universität Ulm, Ulm, GermanyAs 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.https://doi.org/10.7151/dmgt.1800circular arc graphslongest paths intersection |
| spellingShingle | Joos Felix A Note on Longest Paths in Circular Arc Graphs Discussiones Mathematicae Graph Theory circular arc graphs longest paths intersection |
| title | A Note on Longest Paths in Circular Arc Graphs |
| title_full | A Note on Longest Paths in Circular Arc Graphs |
| title_fullStr | A Note on Longest Paths in Circular Arc Graphs |
| title_full_unstemmed | A Note on Longest Paths in Circular Arc Graphs |
| title_short | A Note on Longest Paths in Circular Arc Graphs |
| title_sort | note on longest paths in circular arc graphs |
| topic | circular arc graphs longest paths intersection |
| url | https://doi.org/10.7151/dmgt.1800 |
| work_keys_str_mv | AT joosfelix anoteonlongestpathsincirculararcgraphs AT joosfelix noteonlongestpathsincirculararcgraphs |