Notes on a conjecture of Manoussakis concerning Hamilton cycles in digraphs

DOI10.1016/J.IPL.2014.08.015zbMath1304.05090arXiv1404.5013OpenAlexW2091157114WikidataQ122905083 ScholiaQ122905083MaRDI QIDQ477633

Bo Ning

Publication date: 9 December 2014

Published in: Information Processing Letters (Search for Journal in Brave)

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

zbMATH Keywords

digraphcombinatorial problemsHamilton pathHamilton cycle

Mathematics Subject Classification ID

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

Related Items (2)

A new sufficient condition for a Digraph to be Hamiltonian-A proof of Manoussakis Conjecture ⋮ Extremal digraphs on Woodall‐type condition for Hamiltonian cycles in balanced bipartite digraphs

Cites Work

• Unnamed Item
• A sufficient condition for cyclability in directed graphs
• Hamiltonian paths in oriented graphs
• An Ore-type condition implying a digraph to be pancyclic
• A short proof of Meyniel's theorem
• Cycles through large degree vertices in digraphs: A generalization of Meyniel's theorem
• On pancyclic digraphs
• Une condition suffisante d'existence d'un circuit Hamiltonien dans un graphe oriente
• Directed hamiltonian graphs
• Sufficient Conditions for Circuits in Graphs^†

This page was built for publication: Notes on a conjecture of Manoussakis concerning Hamilton cycles in digraphs