Bounds for the minimal oriented diameter

MaRDI QIDQ2926614zbMATH OpenFDO

Authors Martin Lätsch

Publication date 2 November 2014

Full work available at URL http://d-nb.info/991983610/34, http://kups.ub.uni-koeln.de/2510/1/dissertation_martin_laetsch.pdf

zbMATH Keywords

orientation of an undirected graph with minimal diameter.

Mathematics Subject Classification ID

Distance in graphs (05C12) Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Recommendations

• Bounds for the minimum oriented diameter
• Bilateral orientations and domination
• Improved bound on the oriented diameter of graphs with given minimum degree
• Diameter of orientations of graphs with given minimum degree
• On a relation between the domination number and a strongly connected bidirection of an undirected graph

Cited in

(8)

• On a relation between the domination number and a strongly connected bidirection of an undirected graph
• AT-free graphs: Linear bounds for the oriented diameter
• An improvement to Chvátal and Thomassen's upper bound for oriented diameter
• Bilateral orientations and domination
• scientific article; zbMATH DE number 5307866 (Why is no real title available?)
• Minimum diameter and t_F(f, q)
• Bounds for the minimum oriented diameter
• The oriented diameter of graphs with given connected domination number and distance domination number

This page was built for publication: Bounds for the minimal oriented diameter

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