Directed hamiltonian graphs

DOI10.1002/JGT.3190160106MaRDI QIDQ3990873zbMATH OpenOpenAlexFDO

Authors Y. 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 conditiondirected Hamiltonian graphsstrong digraph

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 908788
• A dominated pair condition for a digraph to be Hamiltonian
• A sufficient condition for a digraph to be Hamiltonian
• A degree condition for Hamiltonian digraphs
• A new sufficient condition for a digraph to be Hamiltonian

Cited in

(22)

• Notes on sufficient conditions for a graph to be hamiltonian
• Cycles through large degree vertices in digraphs: A generalization of Meyniel's theorem
• Quasi-Hamiltonicity: A series of necessary conditions for a digraph to be Hamiltonian
• Sufficient conditions for Hamiltonian cycles in bipartite digraphs
• Sufficient Ore type condition for a digraph to be supereulerian
• A dominated pair condition for a digraph to be Hamiltonian
• A semiexact degree condition for Hamilton cycles in digraphs
• scientific article; zbMATH DE number 4014752 (Why is no real title available?)
• A sufficient condition for a digraph to be Hamiltonian
• scientific article; zbMATH DE number 1472153 (Why is no real title available?)
• scientific article; zbMATH DE number 1792615 (Why is no real title available?)
• Notes on a conjecture of Manoussakis concerning Hamilton cycles in digraphs
• scientific article; zbMATH DE number 908788 (Why is no real title available?)
• A new sufficient condition for a Digraph to be Hamiltonian-A proof of Manoussakis Conjecture
• On longest non-Hamiltonian cycles in digraphs with the conditions of Bang-Jensen, Gutin and Li
• scientific article; zbMATH DE number 3893232 (Why is no real title available?)
• Preface
• A new sufficient condition for a 2-strong digraph to be Hamiltonian
• On Hamiltonian bypasses in orgraphs with large semi-degrees
• SC-Hamiltonian graphs and digraphs: new necessary conditions and their impacts
• Hamilton cycles in digraphs of unitary matrices
• A sufficient condition for cyclability in directed graphs

This page was built for publication: Directed hamiltonian graphs

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