Weak Three-Linking in Eulerian Dgraphs

DOI10.1137/0404009zbMath0721.05026OpenAlexW1988577972MaRDI QIDQ5752593

No author found.

Publication date: 1991

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

Full work available at URL: https://doi.org/10.1137/0404009

zbMATH Keywords

Eulerian digraphdisjoint pathsweak three-linking

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45)

Related Items (5)

NP-completeness of some edge-disjoint paths problems ⋮ Directed Steiner tree packing and directed tree connectivity ⋮ Multiflow Feasibility: An Annotated Tableau ⋮ Disjoint paths in symmetric digraphs ⋮ Euler Digraphs

This page was built for publication: Weak Three-Linking in Eulerian Dgraphs