On the \(l\)-connectivity of a digraph

DOI10.1016/0012-365X(92)00470-CzbMath0797.05050OpenAlexW2031811693MaRDI QIDQ1322219

Henda C. Swart, Ortrud R. Oellermann, David P. Day

Publication date: 10 October 1994

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

Full work available at URL: https://doi.org/10.1016/0012-365x(92)00470-c

zbMATH Keywords

digraphstrong independence numberstrong componentsstrong \(l\)-arc connectivitystrong \(l\)-connectivitystrong \(l\)-connectivity functionstrong connectivity numbers

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40)

Cites Work

• On the \(\ell\)-connectivity of a graph
• Maximal Flow Through a Network
• A Simple Algorithm for Finding Maximal Network Flows and an Application to the Hitchcock Problem
• The connectivity function of a graph
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the \(l\)-connectivity of a digraph