On Relative Length of Long Paths and Cycles in Graphs

arXiv1407.8129MaRDI QIDQ6253552FDOQ6253552

Authors: Zh. G. Nikoghosyan 

Publication date: 30 July 2014

Abstract: Let $G$ be a graph on $n$ vertices, $p$ the order of a longest path and $kappa$ the connectivity of $G$. In 1989, Bauer, Broersma Li and Veldman proved that if $G$ is a 2-connected graph with $d(x)+d(y)+d(z)gen+kappa$ for all triples $x,y,z$ of independent vertices, then $G$ is hamiltonian. In this paper we improve this result by reducing the lower bound $n+kappa$ to $p+kappa$.

This page was built for publication: On Relative Length of Long Paths and Cycles in Graphs

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