Pages that link to "Item:Q1340120"

The following pages link to Minimizing and maximizing the diameter in orientations of graphs (Q1340120):

Displaying 18 items.

• The orientation number of two complete graphs with linkages (Q556840) (← links)
• On a conjecture concerning the orientation number of a graph (Q1024476) (← links)
• Addendum to: The diameter of an orientation of a complete multipartite graph [Discrete Math. 149 (1996) 131--139] (Q1367048) (← links)
• Optimal orientations of products of paths and cycles (Q1377664) (← links)
• On optimal orientations of Cartesian products of graphs. I (Q1584382) (← links)
• AT-free graphs: Linear bounds for the oriented diameter (Q1827858) (← links)
• On optimal orientations of Cartesian products with a bipartite graph (Q1961236) (← links)
• Optimal oriented diameter of graphs with diameter 3 (Q2131872) (← links)
• Diameter of orientations of graphs with given minimum degree (Q2349963) (← links)
• Multipartite tournaments: a survey (Q2463897) (← links)
• Lower and upper orientable strong radius and strong diameter of complete \(k\)-partite graphs (Q2499582) (← links)
• The minimum diameter of orientations of complete multipartite graphs (Q2563422) (← links)
• On optimal orientation of cycle vertex multiplications (Q2566147) (← links)
• Directing Road Networks by Listing Strong Orientations (Q2819493) (← links)
• Minimum-cost strong network orientation problems: Classification, complexity, and algorithms (Q4540090) (← links)
• On optimal orientations of complete tripartite graphs (Q5000286) (← links)
• Oriented diameter of maximal outerplanar graphs (Q6056752) (← links)
• Large girth and small oriented diameter graphs (Q6197710) (← links)