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
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
C. Berge, A. Ghouila-Houri, Programmes, Jeux et Réseaux de transport, Part 2, Chap.1, Dunod (1962), p.128.
C. Berge, M. Las Vergnas, On transversals of circuits in graphs and oriented matroids, to appear in Discrete Math., 1983.
V. Chvátal, C. Thomassen, Distances in orientations of graphs, J. Comb. Theory, Ser. B 24 (1978), 61–75.
Dambit, Grinberg, 1965, cited in: Berge, Graphes et Hypergraphes, Chap. 18, Exercise 13, Dunod 1970.
M. Las Vergnas, Orientations, Cahiers du C.E.R.O. Bruxelles, 17 (1975), 261–265.
L. Lovàsz, On two minimal theorems in graphs, J. Comb. Theory, Ser. B 21 (1976), 96–103.
C. Lucchesi, D. H. Younger, cited in [6].
W. Mader, About directed graphs, Annals of Discrete Math., 3 (1978), 145–146.
C. St. J. A. Nash-Williams, On orientations, connectivity and odd-vertex-pairings in finite graphs, Can. J. Math., 12 (1960), 555–567.
M. E. Robbins, A theorem on graphs with an application to a problem of traffic control, Am. Math. Mon., 46 (1939), 281–283.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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
