On optimal orientations of Cartesian products of trees
From MaRDI portal
Publication:5936094
DOI10.1007/s003730170057zbMath0984.05042OpenAlexW1968562032MaRDI QIDQ5936094
Publication date: 7 May 2002
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s003730170057
Trees (05C05) Paths and cycles (05C38) Distance in graphs (05C12) Directed graphs (digraphs), tournaments (05C20)
Related Items
Optimal orientations of vertex-multiplications of cartesian products of graphs, The diameter of strong orientations of Cartesian products of graphs, The optimal strong radius and optimal strong diameter of the Cartesian product graphs, On optimal orientations of Cartesian products with a bipartite graph, A degree condition for diameter two orientability of graphs, The diameter of strong orientations of strong products of graphs, The orientation number of two complete graphs with linkages, Optimal orientations of strong products of paths, On a conjecture concerning the orientation number of a graph