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

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 $\overline{p}$ and $\overline{c}$ , respectively, combined with minimum degree $δ$ : (1) $∣ C ∣ \geq (\overline{p} + 2) (δ - \overline{p})$ and (2) $∣ C ∣ \geq (\overline{c} + 1) (δ - \overline{c} + 1)$ .

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

文献摘要

讨论

讲解博客

AI智能校验

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

文献摘要

讨论

讲解博客

AI智能校验

On Longest Cycle CC of a graph GG via Structures of G−CG−C

文献摘要

讨论

|讲解博客

|AI智能校验

On Longest Cycle CC of a graph GG via Structures of G−CG−C

文献摘要

讨论

|讲解博客

|AI智能校验

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

讲解博客

AI智能校验

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

讲解博客

AI智能校验