A new sufficient condition for a Digraph to be Hamiltonian-A proof of Manoussakis Conjecture
From MaRDI portal
Publication:4987265
DOI10.23638/DMTCS-22-4-12zbMath1462.05156arXiv1907.08385MaRDI QIDQ4987265
Publication date: 3 May 2021
Full work available at URL: https://arxiv.org/abs/1907.08385
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A survey on Hamilton cycles in directed graphs
- Notes on a conjecture of Manoussakis concerning Hamilton cycles in digraphs
- A sufficient condition for cyclability in directed graphs
- Pancyclism and Meyniel's conditions
- A short proof of Meyniel's theorem
- On pancyclic digraphs
- How close to regular must a semicomplete multipartite digraph be to secure Hamiltonicity?
- Une condition suffisante d'existence d'un circuit Hamiltonien dans un graphe oriente
- Note on Hamilton Circuits
- Cycles in digraphs– a survey
- Directed hamiltonian graphs
- The Theory of Round Robin Tournaments
- Sufficient Conditions for Circuits in Graphs†