A sufficient condition for cyclability in directed graphs

DOI10.1016/j.disc.2005.11.066zbMath1115.05053OpenAlexW2067703570MaRDI QIDQ878617

Hao Li, Jin-Long Shu, Evelyne Flandrin

Publication date: 26 April 2007

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2005.11.066

zbMATH Keywords

digraphHamiltoniandegreetheorem of Meyniel

Mathematics Subject Classification ID

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

Related Items (3)

Disjoint Cycles in a Digraph with Partial Degree ⋮ A new sufficient condition for a Digraph to be Hamiltonian-A proof of Manoussakis Conjecture ⋮ Notes on a conjecture of Manoussakis concerning Hamilton cycles in digraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Cycles through prescribed vertices with large degree sum
• Une condition suffisante d'existence d'un circuit Hamiltonien dans un graphe oriente
• Directed hamiltonian graphs
• 2‐neighborhoods and hamiltonian conditions
• Sequences, claws and cyclability of graphs
• Sufficient Conditions for Circuits in Graphs^†

This page was built for publication: A sufficient condition for cyclability in directed graphs