Superfluous paths in strong digraphs

DOI10.1016/0012-365X(83)90097-3zbMath0526.05028MaRDI QIDQ594892

Jeffrey A. Ross, Cláudio Leonardo Lucchesi

Publication date: 1983

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

zbMATH Keywords

branchstrongly connected digraph

Mathematics Subject Classification ID

Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40)

Related Items (1)

On the Exponent of a Primitive, Nearly Reducible Matrix. II

Cites Work

• A unified treatment of nearly reducible and nearly decomposable matrices
• On the Exponent of a Primitive, Nearly Reducible Matrix. II
• Minimally 2-connected graphs.
• On Minimal Blocks
• Minimally strong digraphs
• Unnamed Item

This page was built for publication: Superfluous paths in strong digraphs