A sufficient condition for a digraph to be Hamiltonian

MaRDI QIDQ3501984zbMATH OpenFDO

Authors Ruijuan Li, Xinhong Zhang, Shengjia Li

Publication date 3 June 2008

zbMATH Keywords

\(C\)-bypasscommon in-neighborcommon out-neighborHamiltonian digraph

Mathematics Subject Classification ID

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

Recommendations

• A degree condition for Hamiltonian digraphs
• scientific article; zbMATH DE number 908788
• A sufficient condition for the hamiltonian property of digraphs with large semi-degrees
• Directed hamiltonian graphs
• A new sufficient condition for a digraph to be Hamiltonian

Cited in

(8)

• Quasi-Hamiltonicity: A series of necessary conditions for a digraph to be Hamiltonian
• A dominated pair condition for a digraph to be Hamiltonian
• Directed hamiltonian graphs
• scientific article; zbMATH DE number 1334635 (Why is no real title available?)
• scientific article; zbMATH DE number 205869 (Why is no real title available?)
• A sufficient condition for the hamiltonian property of digraphs with large semi-degrees
• A new sufficient condition for a 2-strong digraph to be Hamiltonian
• A degree condition for Hamiltonian digraphs

This page was built for publication: A sufficient condition for a digraph to be Hamiltonian

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3501984)