Longest cycles in 3‐connected graphs contain three contractible edges

Nathaniel Dean, Robert L. Hemminger, Katsuhiro Ota

Research output: Contribution to journalArticle

17 Citations (Scopus)

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 languageEnglish
Pages (from-to)17-21
Number of pages5
JournalJournal of Graph Theory
Volume13
Issue number1
DOIs
Publication statusPublished - 1989
Externally publishedYes

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