Weak Three-Linking in Eulerian Dgraphs

DOI10.1137/0404009MaRDI QIDQ5752593zbMATH OpenOpenAlexFDO

Authors

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

disjoint pathsEulerian digraphweak three-linking

Mathematics Subject Classification ID

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

Recommendations

• Two arc disjoint paths in Eulerian digraphs
• Two Arc-Disjoint Paths in Eulerian Digraphs
• scientific article; zbMATH DE number 4103110
• A linear time algorithm for finding three edge-disjoint paths in Eulerian networks
• Euler digraphs

Cited in

(8)

• Disjoint paths in symmetric digraphs
• NP-completeness of some edge-disjoint paths problems
• Multiflow Feasibility: An Annotated Tableau
• Euler digraphs
• Two Arc-Disjoint Paths in Eulerian Digraphs
• Weakly 3-Connected Graphs
• Directed Steiner tree packing and directed tree connectivity
• Two arc disjoint paths in Eulerian digraphs

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

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