Skip to main content
Springer Nature Link
Log in

Optimal Orientations of Graphs and Digraphs: A Survey

  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract.

 For a graph or digraph G, let be the family of strong orientations of G; and for any , we denote by d(D) the diameter of D. Define . In this paper, we survey the results obtained and state some problems and conjectures for the parameter .

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+
from $39.99 /Month
  • Starting from 10 chapters or articles per month
  • Access and download chapters and articles from more than 300k books and 2,500 journals
  • Cancel anytime
View plans

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Explore related subjects

Discover the latest articles and news from researchers in related subjects, suggested using machine learning.

Author information

Authors and Affiliations

  1. Department of Mathematics, National University of Singapore, 2 Science Drive 2, 117543 Singapore, , , , , , SG

    K.M. Koh

  2. Mathematics and Mathematics Education, National Institute of Education, Nanyang Technological University, 1 Nanyang Walk, 637616 Singapore, , , , , , SG

    E.G. Tay

Authors
  1. K.M. Koh
    View author publications

    Search author on:PubMed Google Scholar

  2. E.G. Tay
    View author publications

    Search author on:PubMed Google Scholar

Additional information

Received: October, 2001 Final version received: September 23, 2002

Rights and permissions

Reprints and permissions

About this article

Cite this article

Koh, K., Tay, E. Optimal Orientations of Graphs and Digraphs: A Survey. Graphs Comb 18, 745–756 (2002). https://doi.org/10.1007/s003730200060

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s003730200060

Keywords