The binding number of a digraph and its computation

MaRDI QIDQ5432893zbMATH OpenFDO

Authors Jun Su, Genjiu Xu, Shenggui Zhang

Publication date 18 December 2007

zbMATH Keywords

binding numberCaccetta-Häggkvist conjecturedirected graphpolynomial time

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• The Binding Number of a Digraph
• Directed triangles in digraphs
• On directed triangles in digraphs
• Counting subgraphs: A new approach to the Caccetta-Häggkvist conjecture
• The binding number of a graph and its triangle

Cited in

(2)

• Computing the binding number of a graph
• The Binding Number of a Digraph

This page was built for publication: The binding number of a digraph and its computation

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