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

MaRDI QIDQ4732485zbMATH OpenFDO

Authors Samvel Kh. Darbinyan

Publication date 1986

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

zbMATH Keywords

digraphHamiltonian

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45)

Abstract: Let $D$ be a digraph on $pgeq5$ vertices with minimum degree at least $p-1$ and with minimum semi-degree at least $p/2-1$. 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 $p-1$; (ii) if $p=2n$, then $D$ is hamiltonian.

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)

• scientific article; zbMATH DE number 908788 (Why is no real title available?)
• 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
• scientific article; zbMATH DE number 1334635 (Why is no real title available?)
• 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)