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
出版物ステータスPublished - 1997 3

Fingerprint

Long Cycle
Connected graph
Cycle
Theorem

ASJC Scopus subject areas

  • Mathematics(all)

これを引用

Long Cycles Passing Through a Specified Edge in a 3-Connected Graph. / Enomoto, Hikoe; Hirohata, Kazuhide; Ota, Katsuhiro.

:: Journal of Graph Theory, 巻 24, 番号 3, 03.1997, p. 275-279.

研究成果: Article

Enomoto, H, Hirohata, K & Ota, K 1997, 'Long Cycles Passing Through a Specified Edge in a 3-Connected Graph', Journal of Graph Theory, 巻. 24, 番号 3, pp. 275-279.
Enomoto, Hikoe ; Hirohata, Kazuhide ; Ota, Katsuhiro. / Long Cycles Passing Through a Specified Edge in a 3-Connected Graph. :: Journal of Graph Theory. 1997 ; 巻 24, 番号 3. pp. 275-279.
@article{54ca7fe9449a430cb1a6ee7aa1c69e00,
title = "Long Cycles Passing Through a Specified Edge in a 3-Connected Graph",
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}.",
author = "Hikoe Enomoto and Kazuhide Hirohata and Katsuhiro Ota",
year = "1997",
month = "3",
language = "English",
volume = "24",
pages = "275--279",
journal = "Journal of Graph Theory",
issn = "0364-9024",
publisher = "Wiley-Liss Inc.",
number = "3",

}

TY - JOUR

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

AU - Enomoto, Hikoe

AU - Hirohata, Kazuhide

AU - Ota, Katsuhiro

PY - 1997/3

Y1 - 1997/3

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

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

UR - http://www.scopus.com/inward/record.url?scp=0347076283&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0347076283&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:0347076283

VL - 24

SP - 275

EP - 279

JO - Journal of Graph Theory

JF - Journal of Graph Theory

SN - 0364-9024

IS - 3

ER -