On Longest Cycle C of a graph G via Structures of G-C

Abstract: Two sharp lower bounds for the length of a longest cycle

C

of a graph

G

are presented in terms of the lengths of a longest path and a longest cycle of

G - C

, denoted by

o v e r l i n e p

and

o v e r l i n e c

, respectively, combined with minimum degree

d e l t a

: (1)

| C | g e q (o v e r l i n e p + 2) (d e l t a - o v e r l i n e p)

and (2)

| C | g e q (o v e r l i n e c + 1) (d e l t a - o v e r l i n e c + 1)

.

This page was built for publication: On Longest Cycle $C$ of a graph $G$ via Structures of $G-C$