Robbins's Theorem for Mixed Multigraphs
From MaRDI portal
Publication:3900089
DOI10.2307/2321858zbMath0453.05026OpenAlexW4236077582MaRDI QIDQ3900089
Publication date: 1980
Published in: The American Mathematical Monthly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2321858
Related Items (43)
Orientations of digraphs almost preserving diameter ⋮ On the optimal strongly connected orientations of city street graphs. IV: Four east-west avenues or north-south streets ⋮ Minimizing and maximizing the diameter in orientations of graphs ⋮ The diameter of an orientation of a complete multipartite graph ⋮ Optimal orientations of vertex-multiplications of cartesian products of graphs ⋮ On optimal orientations of complete tripartite graphs ⋮ Optimal orientations of products of paths and cycles ⋮ On orientations and shortest paths ⋮ Approximation algorithms for orienting mixed graphs ⋮ On the existence and number of (\(k+1\))-kings in \(k\)-quasi-transitive digraphs ⋮ Improved bounds for the oriented radius of mixed multigraphs ⋮ Model and methods to address urban road network problems with disruptions ⋮ The complexity of 2-vertex-connected orientation in mixed graphs ⋮ A possible optimal design of one-way Hamming network \(H(n,3)\) based on the minimum transmission latency ⋮ Unnamed Item ⋮ On 2-strong connectivity orientations of mixed graphs and related problems ⋮ Approximating Minimum Cost Connectivity Orientation and Augmentation ⋮ Upward and quasi-upward planarity testing of embedded mixed graphs ⋮ On optimal orientations of Cartesian products with a bipartite graph ⋮ Tree-compositions and orientations ⋮ Path-driven orientation of mixed graphs ⋮ Multipartite tournaments: a survey ⋮ Prime orientable graphs ⋮ Methods for solving road network problems with disruptions ⋮ Strongly connectable digraphs and non-transitive dice ⋮ Approximation Algorithms for Orienting Mixed Graphs ⋮ The orientation number of two complete graphs with linkages ⋮ A note on orientations of mixed graphs ⋮ Diameter three orientability of bipartite graphs ⋮ The edge-orientation problem and some of its variants on weighted graphs ⋮ Strong subgraph connectivity of digraphs ⋮ Graphs with Many Strong Orientations ⋮ Directing Road Networks by Listing Strong Orientations ⋮ On a conjecture concerning the orientation number of a graph ⋮ Unnamed Item ⋮ Unnamed Item ⋮ The minimum diameter of orientations of complete multipartite graphs ⋮ On optimal orientation of cycle vertex multiplications ⋮ Basic Terminology, Notation and Results ⋮ Quasi-Transitive Digraphs and Their Extensions ⋮ Lexicographic Orientation Algorithms ⋮ On optimal orientations of Cartesian products of graphs. I ⋮ Decreasing minimization on M-convex sets: algorithms and applications
This page was built for publication: Robbins's Theorem for Mixed Multigraphs
