diff --git a/pyrival/graphs/edge_bcc.py b/pyrival/graphs/edge_bcc.py
index 7b15a4a..4fe2385 100644
--- a/pyrival/graphs/edge_bcc.py
+++ b/pyrival/graphs/edge_bcc.py
@@ -60,6 +60,8 @@ def find_SCC(graph):
 """
 Given an undirected simple graph, find_BCC returns a list of lists 
 containing the edge biconnected components of the graph (i.e. no bridges).
+In a biconnected component, any two nodes are connected by at least two
+edge-disjoint paths.
 Runs in O(n + m) time.
 
 This algorithm is based on https://cses.fi/problemset/task/2177
diff --git a/pyrival/graphs/node_bcc.py b/pyrival/graphs/node_bcc.py
index dbfc383..4e86873 100644
--- a/pyrival/graphs/node_bcc.py
+++ b/pyrival/graphs/node_bcc.py
@@ -24,6 +24,8 @@
 """
 Given an undirected graph, find_BCC returns a list of lists containing the nodes 
 of the different node-biconnected components.
+Node-biconnected components are maximal subgraphs that cannot be disconnected
+by removing a single node.
 Note that a node belongs to multiple node-bccs iff it is an articulation point.
 """