A sufficient condition for the hamiltonian property of digraphs with large semi-degrees

From MaRDI portal
Publication:4732485

zbMATH Open0683.05022arXiv1111.1843MaRDI QIDQ4732485FDOQ4732485


Authors: Samvel Kh. Darbinyan Edit this on Wikidata


Publication date: 1986

Abstract: Let D be a digraph on pgeq5 vertices with minimum degree at least p1 and with minimum semi-degree at least p/21. For D (unless some extremal cases) we present a detailed proof of the following results [12]: (i) D contains cycles of length 3, 4 and p1; (ii) if p=2n, then D is hamiltonian.


Full work available at URL: https://arxiv.org/abs/1111.1843




Recommendations





Cited In (10)





This page was built for publication: A sufficient condition for the hamiltonian property of digraphs with large semi-degrees

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