Notes on a conjecture of Manoussakis concerning Hamilton cycles in digraphs
From MaRDI portal
(Redirected from Publication:477633)
Abstract: In 1992, Manoussakis conjectured that a strongly 2-connected digraph on vertices is hamiltonian if for every two distinct pairs of independent vertices and we have . In this note we show that has a Hamilton path, which gives an affirmative evidence supporting this conjecture.
Recommendations
Cites work
- A short proof of Meyniel's theorem
- A sufficient condition for cyclability in directed graphs
- An Ore-type condition implying a digraph to be pancyclic
- Cycles through large degree vertices in digraphs: A generalization of Meyniel's theorem
- Directed hamiltonian graphs
- Hamiltonian paths in oriented graphs
- scientific article; zbMATH DE number 3149611 (Why is no real title available?)
- On pancyclic digraphs
- Sufficient Conditions for Circuits in Graphs†
- Une condition suffisante d'existence d'un circuit Hamiltonien dans un graphe oriente
Cited in
(4)
This page was built for publication: Notes on a conjecture of Manoussakis concerning Hamilton cycles in digraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q477633)