A note on a degree sum condition for long cycles in graphs

Details A note on a degree sum condition for long cycles in graphs A note on a degree sum condition for long cycles in graphs

2007-11-28

arxiv.org/abs/0711.4394v2

Mathematics

Combinatorics

5 pages

Scientific paper

We conjecture that a 2-connected graph $G$ of order $n$, in which
$d(x)+d(y)\geq n-k$ for every pair of non-adjacent vertices $x$ and $y$,
contains a cycle of length $n-k$ ($kis odd. This generalizes to long cycles a well-known degree sum condition for
hamiltonicity of Ore. The conjecture is shown to hold for $k=1$.

Affiliated with

Also associated with

No associations

Rating

A note on a degree sum condition for long cycles in graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A note on a degree sum condition for long cycles in graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A note on a degree sum condition for long cycles in graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-248450