Paths, cycles, and arc‐connectivity in digraphs

DOI10.1002/jgt.3190190307zbMath0824.05040OpenAlexW2147491827MaRDI QIDQ4698084

Xiang-Ying Su

Publication date: 9 November 1995

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190190307

zbMATH Keywords

digraphMenger's theoremdisjoint cyclesarc-connectivity\(k\)-arc connected digraphadmissible liftingarc- disjoint paths

Mathematics Subject Classification ID

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

Related Items (2)

Some generalizations of Menger's theorem concerning arc-connected digraphs ⋮ On the \((h,k)\)-domination numbers of iterated line digraphs

Cites Work

• Konstruktion aller n-fach kantenzusammenhaengenden Digraphen

This page was built for publication: Paths, cycles, and arc‐connectivity in digraphs