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

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

研究成果: Article

11 引用 (Scopus)

抜粋

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.

元の言語English
ページ(範囲)361-371
ページ数11
ジャーナルJournal of Graph Theory
17
発行部数3
DOI
出版物ステータスPublished - 1993

ASJC Scopus subject areas

  • Geometry and Topology

フィンガープリント The 3‐connected graphs having a longest cycle containing only three contractible edges' の研究トピックを掘り下げます。これらはともに一意のフィンガープリントを構成します。

  • これを引用