Abstract
Let G be a connected, finite graph. Let C be a circuit of G. β(C), the strong bridge graph of C in G, is defined as follows: (1) the vertices of β(C) are the bridges of C in G, and (2) there is an edge in β(C) joining a pair of vertices B 1 and B 2 if and only if B 1 and B 2 separate each other relative C.
This work was supported in part by N.S.F. grant GJ- 120. The authors would also like to thank Mr. Peng-Siu Mei for comments on the manuscript.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
L. Auslander and S. V. Parter, On Imbedding Graphs in the Sphere, J. Math. Mech. 10 (1961), 517–524.
O. Ore, The Four Color Problem, Academic Press, New York, 1967.
G. Ringel, Färbungsprobleme auf Flächen und Graphen, VEB Deutscher Verlag der Wissenschaften, Berlin, 1959.
W. T Tutte, Matroids and Graphs, Trans. Amer. Math. Soc. 90 (1959), 527–552.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1990 Springer-Verlag New York Inc.
About this chapter
Cite this chapter
Büchi, J.R., Haggard, G. (1990). Jordan Circuits of a Graph. In: Mac Lane, S., Siefkes, D. (eds) The Collected Works of J. Richard Büchi. Springer, New York, NY. https://doi.org/10.1007/978-1-4613-8928-6_10
Download citation
DOI: https://doi.org/10.1007/978-1-4613-8928-6_10
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4613-8930-9
Online ISBN: 978-1-4613-8928-6
eBook Packages: Springer Book Archive