Notes on a conjecture of Manoussakis concerning Hamilton cycles in digraphs

DOI10.1016/J.IPL.2014.08.015zbMATH Open1304.05090arXiv1404.5013OpenAlexW2091157114WikidataQ122905083 ScholiaQ122905083MaRDI QIDQ477633FDOQ477633

Authors: Bo Ning 

Publication date: 9 December 2014

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

Abstract: In 1992, Manoussakis conjectured that a strongly 2-connected digraph $D$ on $n$ vertices is hamiltonian if for every two distinct pairs of independent vertices $x,y$ and $w,z$ we have $d(x)+d(y)+d(w)+d(z)geq4n-3$. In this note we show that $D$ has a Hamilton path, which gives an affirmative evidence supporting this conjecture.

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

Recommendations

• A new sufficient condition for a Digraph to be Hamiltonian-A proof of Manoussakis Conjecture
• A new sufficient condition for a digraph to be Hamiltonian
• A Chvátal-Erdős condition for Hamilton cycles in digraphs
• A dominated pair condition for a digraph to be Hamiltonian
• Preface

zbMATH Keywords

digraphHamilton cyclecombinatorial problemsHamilton path

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (4)

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

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)