Intersections of Longest Paths and Cycles
It is a well known fact in graph theory that in a connected graph any two longest paths must have a vertex in common. In this paper we will explore what happens when we look at k - connected graphs, leading us to make a conjecture about the intersection of any two longest paths. We then look at cycl...
| Main Author: | |
|---|---|
| Format: | Others |
| Published: |
Digital Archive @ GSU
2008
|
| Subjects: | |
| Online Access: | http://digitalarchive.gsu.edu/math_theses/53 http://digitalarchive.gsu.edu/cgi/viewcontent.cgi?article=1052&context=math_theses |