Pages that link to "Item:Q1219300"
From MaRDI portal
The following pages link to Distances in orientations of graphs (Q1219300):
Displaying 50 items.
- Improved bound on the oriented diameter of graphs with given minimum degree (Q326665) (← links)
- Shattering, graph orientations, and connectivity (Q396883) (← links)
- Complete oriented colourings and the oriented achromatic number (Q400508) (← links)
- The complexity of two graph orientation problems (Q412352) (← links)
- Series-parallel orientations preserving the cycle-radius (Q413267) (← links)
- Strongly connected multivariate digraphs (Q521369) (← links)
- On the most imbalanced orientation of a graph (Q721946) (← links)
- Oriented diameter of graphs with diameter 3 (Q965254) (← links)
- On a relation between the domination number and a strongly connected bidirection of an undirected graph (Q1003464) (← links)
- On orientations and shortest paths (Q1123899) (← links)
- On the optimal strongly connected orientations of city street graphs. IV: Four east-west avenues or north-south streets (Q1327239) (← links)
- Optimal orientations of products of paths and cycles (Q1377664) (← links)
- Algorithms for graphs with small octopus (Q1421464) (← links)
- On optimal orientations of Cartesian products of graphs. I (Q1584382) (← links)
- Orientations of digraphs almost preserving diameter (Q1613394) (← links)
- The diameter of strong orientations of Cartesian products of graphs (Q1671321) (← links)
- A degree condition for diameter two orientability of graphs (Q1727780) (← links)
- Methods for solving road network problems with disruptions (Q1742219) (← links)
- AT-free graphs: Linear bounds for the oriented diameter (Q1827858) (← links)
- Minimum average distance of strong orientations of graphs (Q1887055) (← links)
- The diameter of an orientation of a complete multipartite graph (Q1910574) (← links)
- Route-enabling graph orientation problems (Q1939659) (← links)
- On optimal orientations of Cartesian products with a bipartite graph (Q1961236) (← links)
- Diameter three orientability of bipartite graphs (Q2030744) (← links)
- Min-cost-flow preserving bijection between subgraphs and orientations (Q2111782) (← links)
- Optimal oriented diameter of graphs with diameter 3 (Q2131872) (← links)
- An improvement to Chvátal and Thomassen's upper bound for oriented diameter (Q2231791) (← links)
- Diameter of orientations of graphs with given minimum degree (Q2349963) (← links)
- A possible optimal design of one-way Hamming network \(H(n,3)\) based on the minimum transmission latency (Q2424657) (← links)
- The complexity of the proper orientation number (Q2445254) (← links)
- The minimum diameter of orientations of complete multipartite graphs (Q2563422) (← links)
- On optimal orientation of cycle vertex multiplications (Q2566147) (← links)
- A size condition for diameter two orientable graphs (Q2657103) (← links)
- Oriented diameter of graphs with given girth and maximum degree (Q2685322) (← links)
- Outerplanar and Planar Oriented Cliques (Q2811201) (← links)
- Directing Road Networks by Listing Strong Orientations (Q2819493) (← links)
- Minimizing the Oriented Diameter of a Planar Graph (Q2851475) (← links)
- Quasi-Transitive Digraphs and Their Extensions (Q3120440) (← links)
- On the Most Imbalanced Orientation of a Graph (Q3196369) (← links)
- GRAPH ORIENTATION ALGORITHMS TO MINIMIZE THE MAXIMUM OUTDEGREE (Q3434271) (← links)
- (Q3739159) (← links)
- Interpolation theorem for a continuous function on orientations of a simple graph (Q4515315) (← links)
- Oriented hypercubes (Q4537616) (← links)
- Minimum-cost strong network orientation problems: Classification, complexity, and algorithms (Q4540090) (← links)
- (Q4616090) (← links)
- (Q4740601) (← links)
- (Q4953323) (← links)
- On optimal orientations of complete tripartite graphs (Q5000286) (← links)
- An Improvement to Chvátal and Thomassen’s Upper Bound for Oriented Diameter (Q5042233) (← links)
- (Q5134324) (← links)
