Robbins's Theorem for Mixed Multigraphs

Cited in

(45)

On oriented diameter of (n, k)-star graphs
On optimal orientations of complete tripartite graphs
Orientations of digraphs almost preserving diameter
Approximation algorithms for orienting mixed graphs
Strongly connectable digraphs and non-transitive dice
Approximation algorithms for orienting mixed graphs
Path-driven orientation of mixed graphs
Lexicographic orientation algorithms
The orientation number of two complete graphs with linkages
Quasi-transitive digraphs and their extensions
On optimal orientations of Cartesian products of graphs. I
A note on orientations of mixed graphs
Methods for solving road network problems with disruptions
On the existence and number of (k+1)-kings in k-quasi-transitive digraphs
Improved bounds for the oriented radius of mixed multigraphs
On optimal orientation of cycle vertex multiplications
The complexity of 2-vertex-connected orientation in mixed graphs
On orientations and shortest paths
On the optimal strongly connected orientations of city street graphs. IV: Four east-west avenues or north-south streets
Diameter three orientability of bipartite graphs
Basic Terminology, Notation and Results
Prime orientable graphs
Optimal orientations of products of paths and cycles
One-way trail orientations
Model and methods to address urban road network problems with disruptions
Multipartite tournaments: a survey
The diameter of an orientation of a complete multipartite graph
On optimal orientations of Cartesian products with a bipartite graph
Strong subgraph connectivity of digraphs
Graphs with many strong orientations
Upward and quasi-upward planarity testing of embedded mixed graphs
On a conjecture concerning the orientation number of a graph
The edge-orientation problem and some of its variants on weighted graphs
The minimum diameter of orientations of complete multipartite graphs
scientific article; zbMATH DE number 3991541 (Why is no real title available?)
Directing Road Networks by Listing Strong Orientations
Optimal orientations of vertex-multiplications of Cartesian products of graphs
Diameter of orientations of graphs with given order and number of blocks
On 2-strong connectivity orientations of mixed graphs and related problems
Minimizing and maximizing the diameter in orientations of graphs
Approximating Minimum Cost Connectivity Orientation and Augmentation
Optimal orientations of subgraphs of complete bipartite graphs
Tree-compositions and orientations
A possible optimal design of one-way Hamming network \(H(n,3)\) based on the minimum transmission latency
Decreasing minimization on M-convex sets: algorithms and applications

This page was built for publication: Robbins's Theorem for Mixed Multigraphs

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