Minimal strong connected digraphs

MaRDI QIDQ3073018zbMATH OpenFDO

Authors Zhixia Xu

Publication date 5 February 2011

zbMATH Keywords

ear-decompositionquasi-kernelstrong connected digraphs

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Coloring of graphs and hypergraphs (05C15) Connectivity (05C40)

Recommendations

• Bounds of the longest directed cycle length for minimal strong digraphs
• On strong digraphs with a unique minimally strong subdigraph
• Minimal strong digraphs
• Minimally strong subgraph \((k,\ell ) \)-arc-connected digraphs
• scientific article; zbMATH DE number 915661

Cited in

(9)

• Minimal strong digraphs
• On strong digraphs with a unique minimally strong subdigraph
• Bounds of the longest directed cycle length for minimal strong digraphs
• Structural properties of minimal strong digraphs versus trees
• Structure of cycles in minimal strong digraphs
• Structural and spectral properties of minimal strong digraphs
• scientific article; zbMATH DE number 3910427 (Why is no real title available?)
• Minimal n-fach zusammenhängende Digraphen. (Minimally n-connected digraphs)
• Strong-diameter decompositions of minor free graphs

This page was built for publication: Minimal strong connected digraphs

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