id: 04043882
dt: j
an: 04043882
au: Nikogosyan, Zh.G.
ti: A sufficient condition for a graph to be Hamiltonian.
so: Tr. Vychisl. Tsentra Akad. Nauk Arm. SSR Erevan. Gos. Univ. 14, 34-54
    (1985).
py: 1985
pu: Izdatel’stvo Akademii Nauk Armyanskoj SSR, Erevan
la: RU
cc: 
ut: Hamiltonian graph
ci: 
li: 
ab: Let $ν(G)$ ($δ(G)$, $k(G)$, $α(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 $δ(G)\ge
    \max((ν(G)+2k(G))/4, α(G))$ graph $G$ contains a Hamiltonian circuit.
rv: M.Křivanek