Any two blocks of a graph have at most one vertex in common. Also, every vertex belonging to at least two blocks is a cutvertex of , and, conversely, every cutvertex belongs to at least two blocks.
Adapted with permission of the author from by Béla Bollobás, published by Springer-Verlag New York, Inc., 1998.
|Date of creation||2013-03-22 12:32:00|
|Last modified on||2013-03-22 12:32:00|
|Last modified by||digitalis (76)|