04043882

j

04043882 Nikogosyan, Zh.G. A sufficient condition for a graph to be Hamiltonian. Tr. Vychisl. Tsentra Akad. Nauk Arm. SSR Erevan. Gos. Univ. 14, 34-54 (1985). 1985 Izdatel'stvo Akademii Nauk Armyanskoj SSR, Erevan RU Hamiltonian graph 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. M.K\v{r}ivanek