Skip to main content

On the minimum number of arcs to reverse to make a graph strongly connected

  • 475 Accesses

Part of the Lecture Notes in Mathematics book series (LNM,volume 1073)

Keywords

  • Directed Graph
  • Connected Graph
  • Minimum Size
  • Simple Graph
  • Finite Graph

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   34.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   46.00
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. C. Berge, A. Ghouila-Houri, Programmes, Jeux et Réseaux de transport, Part 2, Chap.1, Dunod (1962), p.128.

    Google Scholar 

  2. C. Berge, M. Las Vergnas, On transversals of circuits in graphs and oriented matroids, to appear in Discrete Math., 1983.

    Google Scholar 

  3. V. Chvátal, C. Thomassen, Distances in orientations of graphs, J. Comb. Theory, Ser. B 24 (1978), 61–75.

    CrossRef  MathSciNet  MATH  Google Scholar 

  4. Dambit, Grinberg, 1965, cited in: Berge, Graphes et Hypergraphes, Chap. 18, Exercise 13, Dunod 1970.

    Google Scholar 

  5. M. Las Vergnas, Orientations, Cahiers du C.E.R.O. Bruxelles, 17 (1975), 261–265.

    MathSciNet  Google Scholar 

  6. L. Lovàsz, On two minimal theorems in graphs, J. Comb. Theory, Ser. B 21 (1976), 96–103.

    CrossRef  MATH  Google Scholar 

  7. C. Lucchesi, D. H. Younger, cited in [6].

    Google Scholar 

  8. W. Mader, About directed graphs, Annals of Discrete Math., 3 (1978), 145–146.

    CrossRef  MathSciNet  MATH  Google Scholar 

  9. C. St. J. A. Nash-Williams, On orientations, connectivity and odd-vertex-pairings in finite graphs, Can. J. Math., 12 (1960), 555–567.

    CrossRef  MathSciNet  MATH  Google Scholar 

  10. M. E. Robbins, A theorem on graphs with an application to a problem of traffic control, Am. Math. Mon., 46 (1939), 281–283.

    CrossRef  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 1984 Springer-Verlag

About this paper

Cite this paper

Berge, C. (1984). On the minimum number of arcs to reverse to make a graph strongly connected. In: Koh, K.M., Yap, H.P. (eds) Graph Theory Singapore 1983. Lecture Notes in Mathematics, vol 1073. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0073103

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-13368-1

  • Online ISBN: 978-3-540-38924-8

  • eBook Packages: Springer Book Archive