Journal or Publication Title:
Date of publication:
Volume:
ISSN:
Additional Information:
Title:
Simple proofs of two Dirac-type theorems involving connectivity
Other title:
Creator:
Carlen M. Mosesyan ; Mher Zh. Nikoghosyan ; Zhora G. Nikoghosyan
Subject:
Uncontrolled Keywords:
Մոսեսյան Կ. ; Նիկողոսյան Մ. ; Նիկողոսյան Ժ. ; Мосесян К. ; Никогосян М. ; Никогосян Ж.
Coverage:
Abstract:
In 1981, the third author proved that each 2-connected graph G with ± ¸ (n+·)=3 is hamiltonian and each 3-connected graph contains a cycle of length at least minfn; 3± ¡ ·g, where n denotes the order, ± - the minimum degree and · - the connectivity of G. Short proofs of these two results were given by HÄaggkvist and Yamashita, respectively, occupying more than three pages for actual proofs altogether. Here we give much simpler and shorter proofs actually occupying the two-thirds of a page.