论文信息 - Longest Paths in Circular Arc Graphs - 字舞流文

Longest Paths in Circular Arc Graphs

We show that all maximum length paths in a connected circular arc graph have non-empty intersection.

Richard H. Schelp | Paul N. Balister | Ervin Györi | Jenö Lehel | P. Balister | R. Schelp | J. Lehel | E. Györi

[1] J. Mark Keil. Finding Hamiltonian Circuits in Interval Graphs , 1985, Inf. Process. Lett..

[2] Zdzislaw Skupien,et al. Smallest Sets of Longest Paths with Empty Intersection , 1996, Combinatorics, Probability and Computing.

[3] Paul Erdős,et al. Theory of graphs : proceedings of the colloquium, held at Tihany, Hungary, September, 1966 , 1968 .

[4] Tudor Zamfirescu,et al. On longest paths and circuits in graphs. , 1976 .

[5] H. Voss. Cycles and Bridges in Graphs , 1991 .