A lower bound for the circumference of a graph

Nathan Linial

doi:10.1016/0012-365X(76)90031-5

A lower bound for the circumference of a graph

Nathan Linial^*

^*Corresponding author for this work

Research output: Contribution to journal › Article › peer-review

28 Scopus citations

Abstract

Let G=(V, E) be a block of order n, different from K_n. Let m=min {d(x)+d(y): [x, y]∉E}. We show that if m≤n then G contains a cycle of length at least m.

Original language	English
Pages (from-to)	297-300
Number of pages	4
Journal	Discrete Mathematics
Volume	15
Issue number	3
DOIs	https://doi.org/10.1016/0012-365X(76)90031-5
State	Published - 1976
Externally published	Yes

Access to Document

10.1016/0012-365X(76)90031-5

Cite this

@article{6bdeba2a070e4dd0ada0775ef7f80abd,

title = "A lower bound for the circumference of a graph",

abstract = "Let G=(V, E) be a block of order n, different from Kn. Let m=min {d(x)+d(y): [x, y]∉E}. We show that if m≤n then G contains a cycle of length at least m.",

author = "Nathan Linial",

year = "1976",

doi = "10.1016/0012-365X(76)90031-5",

language = "אנגלית",

volume = "15",

pages = "297--300",

journal = "Discrete Mathematics",

issn = "0012-365X",

publisher = "Elsevier B.V.",

number = "3",

}

TY - JOUR

T1 - A lower bound for the circumference of a graph

AU - Linial, Nathan

PY - 1976

Y1 - 1976

N2 - Let G=(V, E) be a block of order n, different from Kn. Let m=min {d(x)+d(y): [x, y]∉E}. We show that if m≤n then G contains a cycle of length at least m.

AB - Let G=(V, E) be a block of order n, different from Kn. Let m=min {d(x)+d(y): [x, y]∉E}. We show that if m≤n then G contains a cycle of length at least m.

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

U2 - 10.1016/0012-365X(76)90031-5

DO - 10.1016/0012-365X(76)90031-5

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:0042515299

SN - 0012-365X

VL - 15

SP - 297

EP - 300

JO - Discrete Mathematics

JF - Discrete Mathematics

IS - 3

ER -

A lower bound for the circumference of a graph

Abstract

Access to Document

Other files and links

Cite this