A lower bound for the circumference of a graph

Nathan Linial*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

28 Scopus citations


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.

Original languageAmerican English
Pages (from-to)297-300
Number of pages4
JournalDiscrete Mathematics
Issue number3
StatePublished - 1976
Externally publishedYes

Cite this