Two Arc-Disjoint Paths in Eulerian Digraphs

DOI10.1137/S0895480196304970zbMath0910.05031OpenAlexW2080019580MaRDI QIDQ4210224

Toshihide Ibaraki, András Frank, Hiroshi Nagamochi

Publication date: 21 September 1998

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

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

zbMATH Keywords

polynomial time algorithmEulerian graphdisjoint paths

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45)

Related Items (1)

Euler Digraphs

This page was built for publication: Two Arc-Disjoint Paths in Eulerian Digraphs