Cycles through prescribed vertices with large degree sum

Katsuhiro Ota

doi:10.1016/0012-365X(94)00036-I

Cycles through prescribed vertices with large degree sum

Katsuhiro Ota

数理科学科

研究成果: Article › 査読

33 被引用数 (Scopus)

抄録

Let S be a set of vertices of a k-connected graph G. We denote the smallest sum of degrees of k + 1 independent vertices of S by σ_{k + 1}(S; G). We obtain a sharp lower bound of σ_{k + 1}(S; G) for the vertices of S to be contained in a common cycle of G. This result gives a sufficient condition for a k-connected graph to be hamiltonian.

本文言語	English
ページ（範囲）	201-210
ページ数	10
ジャーナル	Discrete Mathematics
巻	145
号	1-3
DOI	https://doi.org/10.1016/0012-365X(94)00036-I
出版ステータス	Published - 1995 10月 13

ASJC Scopus subject areas

理論的コンピュータサイエンス
離散数学と組合せ数学

文献へのアクセス

10.1016/0012-365X(94)00036-I

他のファイルとリンク

引用スタイル

@article{6eac687c05434da3acab24d7395a0261,

title = "Cycles through prescribed vertices with large degree sum",

abstract = "Let S be a set of vertices of a k-connected graph G. We denote the smallest sum of degrees of k + 1 independent vertices of S by σk + 1(S; G). We obtain a sharp lower bound of σk + 1(S; G) for the vertices of S to be contained in a common cycle of G. This result gives a sufficient condition for a k-connected graph to be hamiltonian.",

author = "Katsuhiro Ota",

year = "1995",

month = oct,

day = "13",

doi = "10.1016/0012-365X(94)00036-I",

language = "English",

volume = "145",

pages = "201--210",

journal = "Discrete Mathematics",

issn = "0012-365X",

publisher = "Elsevier",

number = "1-3",

}

TY - JOUR

T1 - Cycles through prescribed vertices with large degree sum

AU - Ota, Katsuhiro

PY - 1995/10/13

Y1 - 1995/10/13

N2 - Let S be a set of vertices of a k-connected graph G. We denote the smallest sum of degrees of k + 1 independent vertices of S by σk + 1(S; G). We obtain a sharp lower bound of σk + 1(S; G) for the vertices of S to be contained in a common cycle of G. This result gives a sufficient condition for a k-connected graph to be hamiltonian.

AB - Let S be a set of vertices of a k-connected graph G. We denote the smallest sum of degrees of k + 1 independent vertices of S by σk + 1(S; G). We obtain a sharp lower bound of σk + 1(S; G) for the vertices of S to be contained in a common cycle of G. This result gives a sufficient condition for a k-connected graph to be hamiltonian.

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

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

U2 - 10.1016/0012-365X(94)00036-I

DO - 10.1016/0012-365X(94)00036-I

M3 - Article

AN - SCOPUS:0038282286

SN - 0012-365X

VL - 145

SP - 201

EP - 210

JO - Discrete Mathematics

JF - Discrete Mathematics

IS - 1-3

ER -

Cycles through prescribed vertices with large degree sum

抄録

ASJC Scopus subject areas

文献へのアクセス

他のファイルとリンク

フィンガープリント

引用スタイル