Problemcore
Biconnected components
Also called Blocks, 2-vertex-connected components.
Partition the edges into maximal biconnected subgraphs (blocks) that share only articulation points.
Partition the edges into maximal biconnected subgraphs (blocks) that share only articulation points.
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag J43BN8 Edit this page History Report an error