Distances in orientations of graphs
From MaRDI portal
Publication:1219300
DOI10.1016/0095-8956(78)90078-3zbMath0311.05115OpenAlexW2000631615MaRDI QIDQ1219300
Carsten Thomassen, Václav Chvátal
Publication date: 1976
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(78)90078-3
Related Items (62)
Orientations of digraphs almost preserving diameter ⋮ On the optimal strongly connected orientations of city street graphs. IV: Four east-west avenues or north-south streets ⋮ An Improvement to Chvátal and Thomassen’s Upper Bound for Oriented Diameter ⋮ Optimal oriented diameter of graphs with diameter 3 ⋮ Minimum average distance of strong orientations of graphs ⋮ Oriented hypercubes ⋮ Unnamed Item ⋮ Improved bound on the oriented diameter of graphs with given minimum degree ⋮ On the Most Imbalanced Orientation of a Graph ⋮ The diameter of an orientation of a complete multipartite graph ⋮ Optimal orientations of vertex-multiplications of cartesian products of graphs ⋮ A size condition for diameter two orientable graphs ⋮ On optimal orientations of complete tripartite graphs ⋮ Optimal orientations of products of paths and cycles ⋮ The diameter of strong orientations of Cartesian products of graphs ⋮ On orientations and shortest paths ⋮ Shattering, graph orientations, and connectivity ⋮ Improved bounds for the oriented radius of mixed multigraphs ⋮ Complete oriented colourings and the oriented achromatic number ⋮ Oriented diameter of maximal outerplanar graphs ⋮ Model and methods to address urban road network problems with disruptions ⋮ The strong network orientation problem ⋮ Bounds for the oriented diameter of planar triangulations ⋮ The complexity of two graph orientation problems ⋮ Series-parallel orientations preserving the cycle-radius ⋮ A possible optimal design of one-way Hamming network \(H(n,3)\) based on the minimum transmission latency ⋮ Route-enabling graph orientation problems ⋮ Oriented diameter of graphs with given girth and maximum degree ⋮ The oriented diameter of graphs with given connected domination number and distance domination number ⋮ Large girth and small oriented diameter graphs ⋮ Unnamed Item ⋮ Algorithms for graphs with small octopus ⋮ On optimal orientations of Cartesian products with a bipartite graph ⋮ The complexity of the proper orientation number ⋮ Unnamed Item ⋮ A degree condition for diameter two orientability of graphs ⋮ An improvement to Chvátal and Thomassen's upper bound for oriented diameter ⋮ Oriented diameter of star graphs ⋮ Methods for solving road network problems with disruptions ⋮ Strongly connected multivariate digraphs ⋮ The diameter of strong orientations of strong products of graphs ⋮ Oriented diameter of graphs with diameter 3 ⋮ On the most imbalanced orientation of a graph ⋮ Optimal orientations of strong products of paths ⋮ Diameter three orientability of bipartite graphs ⋮ On a relation between the domination number and a strongly connected bidirection of an undirected graph ⋮ Minimum-cost strong network orientation problems: Classification, complexity, and algorithms ⋮ Outerplanar and Planar Oriented Cliques ⋮ Unnamed Item ⋮ Directing Road Networks by Listing Strong Orientations ⋮ Unnamed Item ⋮ AT-free graphs: Linear bounds for the oriented diameter ⋮ Unnamed Item ⋮ The minimum diameter of orientations of complete multipartite graphs ⋮ On optimal orientation of cycle vertex multiplications ⋮ Quasi-Transitive Digraphs and Their Extensions ⋮ On optimal orientations of Cartesian products of graphs. I ⋮ Minimizing the Oriented Diameter of a Planar Graph ⋮ GRAPH ORIENTATION ALGORITHMS TO MINIMIZE THE MAXIMUM OUTDEGREE ⋮ Diameter of orientations of graphs with given minimum degree ⋮ Min-cost-flow preserving bijection between subgraphs and orientations ⋮ Interpolation theorem for a continuous function on orientations of a simple graph
Uses Software
Cites Work
This page was built for publication: Distances in orientations of graphs
