|
|
|
|
|
A subgraph $B$ of a graph $G$ is a block of $G$ if either it is a bridge (together with the vertices incident with the bridge) or else it is a maximal 2-connected subgraph of $G$
Any two blocks of a graph $G$ have at most one vertex in common. Also, every vertex belonging to at least two blocks is a cutvertex of $G$ and, conversely, every cutvertex belongs to at least two blocks.
|
"block" is owned by digitalis.
|
|
(view preamble | get metadata)
Cross-references: conversely, cutvertex, incident, vertices, bridge, graph, subgraph
There are 7 references to this entry.
This is version 1 of block, born on 2002-03-07.
Object id is 2775, canonical name is Block.
Accessed 5280 times total.
Classification:
| AMS MSC: | 05C99 (Combinatorics :: Graph theory :: Miscellaneous) |
|
|
|
|
|
|
Pending Errata and Addenda
|
|
|
|
|
|
|
|
|
|
|
