scientific article; zbMATH DE number 3991530

MaRDI QIDQ3754020zbMATH OpenFDO

Authors Ján Plesník

Publication date 1985

zbMATH Keywords

diametermultimigraphsorientationsradiusweighted multigraphs

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Paths and cycles (05C38)

Recommendations

• scientific article; zbMATH DE number 3991541
• Minimizing and maximizing the diameter in orientations of graphs
• The diameter of strong orientations of strong products of graphs
• The diameter of an orientation of a complete multipartite graph
• Diameter of orientations of graphs with given minimum degree

Cited in

(29)

• On a conjecture concerning the orientation number of a graph
• Addendum to: The diameter of an orientation of a complete multipartite graph [Discrete Math. 149 (1996) 131--139]
• Optimal orientations of products of paths and cycles
• On optimal orientations of Cartesian products of graphs. I
• Orientations of digraphs almost preserving diameter
• A degree condition for diameter two orientability of graphs
• On optimal orientations of Cartesian products with a bipartite graph
• Diameters of cocircuit graphs of oriented matroids: an update
• Optimal oriented diameter of graphs with diameter 3
• Diameter of orientations of graphs with given minimum degree
• The minimum diameter of orientations of complete multipartite graphs
• On optimal orientation of cycle vertex multiplications
• Oriented diameter of graphs with given girth and maximum degree
• The complexity of deciding whether a graph admits an orientation with fixed weak diameter
• scientific article; zbMATH DE number 6837061 (Why is no real title available?)
• scientific article; zbMATH DE number 3991541 (Why is no real title available?)
• scientific article; zbMATH DE number 1953095 (Why is no real title available?)
• Complexity of approximating the oriented diameter of chordal graphs
• On optimal orientations of complete tripartite graphs
• Optimal orientations of subgraphs of complete bipartite graphs
• The orientation number of two complete graphs with linkages
• Oriented diameter of maximal outerplanar graphs
• The oriented diameter of a bridgeless graph with given \(P_3\)
• Large girth and small oriented diameter graphs
• Using the minimum and maximum degrees to bound the diameter of orientations of bridgeless graphs
• On the oriented diameter of near planar triangulations
• Oriented diameter of graphs with diameter 4 and given edge girth
• Lower and upper orientable strong diameters of graphs satisfying the Ore condition
• Oriented diameter of graphs with diameter 3

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 Q3754020)