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

Hikoe Enomoto, Kazuhide Hirohata, Katsuhiro Ota

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

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}.

Original languageEnglish
Pages (from-to)275-279
Number of pages5
JournalJournal of Graph Theory
Volume24
Issue number3
DOIs
Publication statusPublished - 1997 Mar

ASJC Scopus subject areas

  • Geometry and Topology

Fingerprint Dive into the research topics of 'Long Cycles Passing Through a Specified Edge in a 3-Connected Graph'. Together they form a unique fingerprint.

  • Cite this