On optimal orientations of Cartesian products with a bipartite graph

DOI10.1016/S0166-218X(99)00110-9zbMath0941.05035OpenAlexW1994532070MaRDI QIDQ1961236

Publication date: 22 May 2000

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

Full work available at URL: https://doi.org/10.1016/s0166-218x(99)00110-9

zbMATH Keywords

diameter Cartesian products of graphs orientations of graphs

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)

Related Items (6)

Oriented hypercubes ⋮ The diameter of strong orientations of Cartesian products of graphs ⋮ A degree condition for diameter two orientability of graphs ⋮ The orientation number of two complete graphs with linkages ⋮ On a conjecture concerning the orientation number of a graph ⋮ AT-free graphs: Linear bounds for the oriented diameter

Cites Work

Unnamed Item
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
Methods and problems of communication in usual networks
Minimizing and maximizing the diameter in orientations of graphs
Optimal orientations of products of paths and cycles
On optimal orientations of \(G\) vertex-multiplications
On optimal orientations of Cartesian products of graphs. I
The diameter of an orientation of a complete multipartite graph
On optimal orientations of Cartesian products of graphs. II: Complete graphs and even cycles
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
Diameter-preserving orientations of the torus
On optimal orientations of Cartesian products of even cycles
Cycles and paths in semicomplete multipartite digraphs, theorems, and algorithms: a survey
A Theorem on Graphs, with an Application to a Problem of Traffic Control
On optimal orientations of Cartesian products of trees

This page was built for publication: On optimal orientations of Cartesian products with a bipartite graph