Long Cycles Passing Through a Specified Edge in a 3-Connected Graph

Hikoe Enomoto, Kazuhide Hirohata, Katsuhiro Ota

研究成果: Article

2 引用 (Scopus)

抜粋

We prove the following theorem: For a connected noncomplete graph G, let τ(G): = min{dG(u) + dG(v)|dG(u, v) = 2}. Suppose G is a 3-connected noncomplete graph. Then through each edge of G there passes a cycle of length ≥ min{|V(G)|, τ(G) - 1}.

元の言語English
ページ(範囲)275-279
ページ数5
ジャーナルJournal of Graph Theory
24
発行部数3
DOI
出版物ステータスPublished - 1997 3

    フィンガープリント

ASJC Scopus subject areas

  • Geometry and Topology

これを引用