A sufficient condition for a digraph to be Hamiltonian

zbMATH Open1150.05353MaRDI QIDQ3501984FDOQ3501984

Authors: Ruijuan Li, Xinhong Zhang, Shengjia Li 

Publication date: 3 June 2008

Recommendations

• A degree condition for Hamiltonian digraphs
• Publication:4888111
• 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

zbMATH Keywords

Hamiltonian digraph\(C\)-bypasscommon in-neighborcommon out-neighbor

Mathematics Subject Classification ID

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

Cited In (8)

• A degree condition for Hamiltonian digraphs
• Directed hamiltonian graphs
• A new sufficient condition for a 2-strong digraph to be Hamiltonian
• Quasi-Hamiltonicity: A series of necessary conditions for a digraph to be Hamiltonian
• Title not available (Why is that?)
• Title not available (Why is that?)
• A dominated pair condition for a digraph to be Hamiltonian
• A sufficient condition for the hamiltonian property of digraphs with large semi-degrees

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)