Abstract
We show that if G is a 3‐connected graph of order at least seven, then every longest path between distinct vertices in G contains at least two contractible edges. An immediate corollary is that longest cycles in such graphs contain at least three contractible edges.
| Original language | English |
|---|---|
| Pages (from-to) | 17-21 |
| Number of pages | 5 |
| Journal | Journal of Graph Theory |
| Volume | 13 |
| Issue number | 1 |
| DOIs | |
| Publication status | Published - 1989 |
| Externally published | Yes |
ASJC Scopus subject areas
- Geometry and Topology
Fingerprint Dive into the research topics of 'Longest cycles in 3‐connected graphs contain three contractible edges'. Together they form a unique fingerprint.
Cite this
Dean, N., Hemminger, R. L., & Ota, K. (1989). Longest cycles in 3‐connected graphs contain three contractible edges. Journal of Graph Theory, 13(1), 17-21. https://doi.org/10.1002/jgt.3190130105