Directed hamiltonian graphs

DOI10.1002/jgt.3190160106zbMath0755.05074OpenAlexW2018460201MaRDI QIDQ3990873

Yannis Manoussakis

Publication date: 28 June 1992

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190160106

zbMATH Keywords

degree conditionstrong digraphdirected Hamiltonian graphs

Mathematics Subject Classification ID

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

Related Items (7)

A new sufficient condition for a Digraph to be Hamiltonian-A proof of Manoussakis Conjecture ⋮ A sufficient condition for cyclability in directed graphs ⋮ Notes on a conjecture of Manoussakis concerning Hamilton cycles in digraphs ⋮ Sufficient conditions for Hamiltonian cycles in bipartite digraphs ⋮ Sufficient Ore type condition for a digraph to be supereulerian ⋮ On longest non-Hamiltonian cycles in digraphs with the conditions of Bang-Jensen, Gutin and Li ⋮ Cycles through large degree vertices in digraphs: A generalization of Meyniel's theorem

This page was built for publication: Directed hamiltonian graphs