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
Publication date: 1986
Abstract: Let be a digraph on vertices with minimum degree at least and with minimum semi-degree at least . For (unless some extremal cases) we present a detailed proof of the following results [12]: (i) contains cycles of length 3, 4 and ; (ii) if , then is hamiltonian.
Full work available at URL: https://arxiv.org/abs/1111.1843
Recommendations
- scientific article; zbMATH DE number 1334635
- A sufficient condition for a semicomplete multipartite digraph to be Hamiltonian
- A degree condition for Hamiltonian digraphs
- Sufficient conditions for semicomplete multipartite digraphs to be Hamiltonian
- A new sufficient condition for a digraph to be Hamiltonian
- scientific article; zbMATH DE number 54809
- A sufficient condition for a digraph to be Hamiltonian
- scientific article; zbMATH DE number 3893232
- Publication:4888111
Cited In (10)
- Title not available (Why is that?)
- Sufficient conditions for semicomplete multipartite digraphs to be Hamiltonian
- A degree condition for Hamiltonian digraphs
- Sufficient conditions for Hamiltonian cycles in bipartite digraphs
- A new sufficient condition for a 2-strong digraph to be Hamiltonian
- A semiexact degree condition for Hamilton cycles in digraphs
- A sufficient condition for a digraph to be Hamiltonian
- Title not available (Why is that?)
- Sufficient conditions for a balanced bipartite digraph to be even pancyclic
- On longest non-Hamiltonian cycles in digraphs with the conditions of Bang-Jensen, Gutin and Li
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)