\input zb-basic
\input zb-ioport
\iteman{io-port 04043882}
\itemau{Nikogosyan, Zh.G.}
\itemti{A sufficient condition for a graph to be Hamiltonian.}
\itemso{Tr. Vychisl. Tsentra Akad. Nauk Arm. SSR Erevan. Gos. Univ. 14, 34-54 (1985).}
\itemab
Let $\nu(G)$ ($\delta(G)$, $k(G)$, $\alpha(G)$, resp. denote the number of vertices (minimum degree, vertex-connectivity, vertex independence number, resp. of an ordinary graph $G$. It is shown that for $k(G)\ge3$ and $\delta(G)\ge \max((\nu(G)+2k(G))/4, \alpha(G))$ graph $G$ contains a Hamiltonian circuit.
\itemrv{M.K\v{r}ivanek}
\itemcc{}
\itemut{Hamiltonian graph}
\itemli{}
\end