A note on orientations of mixed graphs

DOI10.1016/S0166-218X(01)00228-1zbMath0999.05062MaRDI QIDQ5957358

Refael Hassin, Esther M. Arkin

Publication date: 3 July 2002

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

zbMATH Keywords

connectivityorientationmixed graphs

Mathematics Subject Classification ID

Connectivity (05C40)

Related Items (7)

Approximation algorithms for orienting mixed graphs ⋮ Series-parallel orientations preserving the cycle-radius ⋮ Path-driven orientation of mixed graphs ⋮ Approximation Algorithms for Orienting Mixed Graphs ⋮ A tight lower bound for planar Steiner orientation ⋮ Directing Road Networks by Listing Strong Orientations ⋮ Improved approximation for orienting mixed graphs

Cites Work

• Unnamed Item
• Unnamed Item
• On orientations and shortest paths
• The directed subgraph homeomorphism problem
• Some remarks on Arc‐connectivity, vertex splitting, and orientation in graphs and digraphs
• Robbins's Theorem for Mixed Multigraphs

This page was built for publication: A note on orientations of mixed graphs