A Common Generalization of Dirac's two Theorems

MaRDI QIDQ6250383zbMATH OpenFDO

Authors Zh. G. Nikoghosyan

Publication date 2 April 2014

Abstract: Let $G$ be a 2-connected graph of order $n$ and let $c$ be the circumference - the order of a longest cycle in $G$. In this paper we present a sharp lower bound for the circumference based on minimum degree $delta$ and $p$ - the order of a longest path in $G$. This is a common generalization of two earlier classical results for 2-connected graphs due to Dirac: (i) $cgeminn,2delta$; and (ii) $cgesqrt2p$. Moreover, the result is stronger than (ii).

This page was built for publication: A Common Generalization of Dirac's two Theorems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6250383)