Hostname: page-component-cd9895bd7-jkksz Total loading time: 0 Render date: 2024-12-26T17:18:56.118Z Has data issue: false hasContentIssue false
  • English
  • Français

A Characterization of Block-Graphs

Published online by Cambridge University Press:  20 November 2018

Frank Harary
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

The purpose of this note is to characterize "block-graphs", a collection of graphs defined by a construction involving certain subgraphs called "blocks". A related operation on a graph leads to the study of "cut-point-graphs". The precise relationship between these two operations is made explicit. In order that this characterization be self-contained, we include the necessary definitions.

Type
Research Article
Information
Canadian Mathematical Bulletin , Volume 6 , Issue 1 , January 1963 , pp. 1 - 6
Copyright
Copyright © Canadian Mathematical Society 1963

References

1. Harary, F., An elementary theorem on graphs. Amer. Math. Monthly 66 (1959) 405-407.10.2307/2308754Google Scholar
2. König, D., Théorie der endlichen und unendlichen Graphen. Leipzig, 1936; reprinted New York, 1950.Google Scholar
3. Whitney, H., Non-separable and planar graphs. Trans. Amer. Math. Soc. 34 (1932) 339-362.10.1090/S0002-9947-1932-1501641-2Google Scholar
4. Whyburn, G.T., Cyclicly connected continuous curves. Proc. Natl. Acad. Sci. U.S.A. 13 (1927) 31-38.10.1073/pnas.13.2.31Google Scholar