The 3‐connected graphs having a longest cycle containing only three contractible edges

R. E L Aldred, Robert L. Hemminger, Katsuhiro Ota

Research output: Contribution to journalArticle

11 Citations (Scopus)

Abstract

It is shown that with one small exception, the 3‐connected graphs admitting longest cycles that contain less than four contractible edges of the parent graph are the members of three closely related infinite families. © 1993 John Wiley & Sons, Inc.

Original languageEnglish
Pages (from-to)361-371
Number of pages11
JournalJournal of Graph Theory
Volume17
Issue number3
DOIs
Publication statusPublished - 1993

ASJC Scopus subject areas

  • Geometry and Topology

Fingerprint Dive into the research topics of 'The 3‐connected graphs having a longest cycle containing only three contractible edges'. Together they form a unique fingerprint.

  • Cite this