scientific article; zbMATH DE number 3991541
From MaRDI portal
Publication:3754023
Recommendations
- On optimal orientations of Cartesian products of graphs. II: Complete graphs and even cycles
- The diameter of an orientation of a complete multipartite graph
- On optimal orientations of Cartesian products with a bipartite graph
- scientific article; zbMATH DE number 5307866
- The diameter of strong orientations of strong products of graphs
Cites work
Cited in
(31)- Diameter-preserving orientations of the torus
- On optimal orientations of complete tripartite graphs
- On the strong distance problems of pyramid networks
- Orientations of digraphs almost preserving diameter
- Oriented diameter of maximal outerplanar graphs
- scientific article; zbMATH DE number 3991530 (Why is no real title available?)
- The orientation number of two complete graphs with linkages
- On optimal orientations of Cartesian products of graphs. I
- Improved bounds for the oriented radius of mixed multigraphs
- On optimal orientation of cycle vertex multiplications
- Diameter three orientability of bipartite graphs
- Optimal oriented diameter of graphs with diameter 3
- Optimal orientations of products of paths and cycles
- Multipartite tournaments: a survey
- The diameter of an orientation of a complete multipartite graph
- 3-kings in 3-partite tournaments
- On optimal orientations of Cartesian products with a bipartite graph
- Kings in bipartite tournaments
- Large girth and small oriented diameter graphs
- Oriented diameter of graphs with diameter 3
- On a conjecture concerning the orientation number of a graph
- The minimum diameter of orientations of complete multipartite graphs
- The strong distance problem on the Cartesian product of graphs
- scientific article; zbMATH DE number 5307866 (Why is no real title available?)
- On finding orientations with the fewest number of vertices with small out-degree
- Optimal orientations of vertex-multiplications of Cartesian products of graphs
- AT-free graphs: Linear bounds for the oriented diameter
- Minimum average distance of strong orientations of graphs
- Minimizing and maximizing the diameter in orientations of graphs
- Diameter of orientations of graphs with given minimum degree
- A possible optimal design of one-way Hamming network \(H(n,3)\) based on the minimum transmission latency
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3754023)
