On optimal orientations of Cartesian products of graphs. I
From MaRDI portal
Publication:1584382
DOI10.1016/S0012-365X(98)00038-7zbMath0957.05051MaRDI QIDQ1584382
Publication date: 2 November 2000
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0012-365x(98)00038-7
05C20: Directed graphs (digraphs), tournaments
Related Items
The diameter of strong orientations of strong products of graphs, The orientation number of two complete graphs with linkages, On a conjecture concerning the orientation number of a graph, Optimal orientations of products of paths and cycles, The diameter of strong orientations of Cartesian products of graphs, On optimal orientations of Cartesian products with a bipartite graph
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Orientations of the n-cube with minimum diameter
- Every vertex a king
- Distances in orientations of graphs
- 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
- Optimal orientations of products of paths and cycles
- The diameter of an orientation of a complete multipartite graph
- The minimum diameter of orientations of complete multipartite graphs
- On the optimal strongly connected orientations of city street graphs. II: Two east-west avenues or North—South Streets
- Strongly connected orientations of mixed multigraphs
- On the Optimal Strongly Connected Orientations of City Street Graphs I: Large Grids
- Robbins's Theorem for Mixed Multigraphs
- On the optimal strongly connected orientations of city street graphs. III. Three east–west avenues or north–south streets
- On optimal orientations of Cartesian products of even cycles and paths
- On optimal orientations of Cartesian products of even cycles
- A Theorem on Graphs, with an Application to a Problem of Traffic Control
