## Details

A graph is biconnected if the removal of any single vertex (and its adjacent edges) does not disconnect it.

igraph does not consider single-vertex graphs biconnected.

Note that some authors do not consider the graph consisting of two connected vertices as biconnected, however, igraph does.

## See also

`articulation_points()`

, `biconnected_components()`

,
`is_connected()`

, `vertex_connectivity()`

Connected components
`articulation_points()`

,
`biconnected_components()`

,
`component_distribution()`

,
`decompose()`

## Examples

```
is_biconnected(make_graph("bull"))
#> [1] FALSE
is_biconnected(make_graph("dodecahedron"))
#> [1] TRUE
is_biconnected(make_full_graph(1))
#> [1] FALSE
is_biconnected(make_full_graph(2))
#> [1] TRUE
```