A Characterization of Block-Graphs

1 January 1963

journal article
Published by Canadian Mathematical Society in Canadian Mathematical Bulletin

Vol. 6 (1) , 1-6
https://doi.org/10.4153/cmb-1963-001-x

Abstract

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.

Keywords

NOTE
BLOCKS
BLOCK GRAPHS
MADE
EXPLICIT
CUT
PRECISE
SUBGRAPHS
GRAPHS THE PURPOSE

This publication has 3 references indexed in Scilit:

An Elementary Theorem on Graphs
The American Mathematical Monthly, 1959
Non-separable and planar graphs
Transactions of the American Mathematical Society, 1932
Cyclicly Connected Continuous Curves
Proceedings of the National Academy of Sciences, 1927