Minimizing the oriented diameter of a planar graph

DOI10.1016/J.ENDM.2009.07.043MaRDI QIDQ2851475zbMATH OpenOpenAlexFDO

Authors Nicole Eggemann, Steven D. Noble

Publication date 10 October 2013

Published in Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.endm.2009.07.043

zbMATH Keywords

diametergraph minorsgraph orientationplanar graph

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Distance in graphs (05C12) Directed graphs (digraphs), tournaments (05C20)

Recommendations

• The complexity of two graph orientation problems
• Planar oriented graphs of diameter two
• scientific article; zbMATH DE number 1953095
• Complexity of approximating the oriented diameter of chordal graphs
• Diameter of orientations of graphs with given minimum degree

Cites work

• A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
• Bidimensional Parameters and Local Treewidth
• Diameter and treewidth in minor-closed graph families
• Distances in orientations of graphs
• Graph minors. III. Planar tree-width
• Quickly excluding a planar graph

Cited in

(15)

• A degree condition for diameter two orientability of graphs
• Route-enabling graph orientation problems
• An improvement to Chvátal and Thomassen's upper bound for oriented diameter
• Location of speed-up subnetworks
• Oriented diameter of grids
• scientific article; zbMATH DE number 5307866 (Why is no real title available?)
• Planar oriented graphs of diameter two
• The complexity of two graph orientation problems
• Series-parallel orientations preserving the cycle-radius
• An Improvement to Chvátal and Thomassen’s Upper Bound for Oriented Diameter
• Improved bounds for the oriented radius of mixed multigraphs
• Bounds for the oriented diameter of planar triangulations
• On oriented diameter of (n, k)-star graphs
• On the oriented diameter of planar triangulations
• On oriented diameter of power graphs

This page was built for publication: Minimizing the oriented diameter of a planar graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2851475)