Name
Abstract | ||
|---|---|---|
We show that all maximum length paths in a connected circular arc graph have non-empty intersection. |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1017/S0963548304006145 | Combinatorics, Probability & Computing |
Keywords | Field | DocType |
longest paths,interval graph,circular arc graph,maximum length path,connected circular arc graph,circular arc graphs,non-empty intersection,longest path | Discrete mathematics,Block graph,Outerplanar graph,Combinatorics,Circle graph,Cycle graph,Distance-hereditary graph,Book embedding,Circular-arc graph,Mathematics,Planar graph | Journal |
Volume | Issue | ISSN |
13 | 3 | 0963-5483 |
Citations | PageRank | References |
4 | 0.70 | 2 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Paul N. Balister | 1 | 40 | 7.21 |
| Ervin Györi | 2 | 88 | 21.62 |
| Jenö Lehel | 3 | 141 | 24.61 |
| Richard H. Schelp | 4 | 274 | 61.72 |