Index: lemon/connectivity.h
===================================================================
--- lemon/connectivity.h (revision 986)
+++ lemon/connectivity.h (revision 987)
@@ -750,5 +750,11 @@
///
/// \return \c true if the graph bi-node-connected.
- /// \note By definition, the empty graph is bi-node-connected.
+ ///
+ /// \note By definition,
+ /// \li a graph consisting of zero or one node is bi-node-connected,
+ /// \li a graph consisting of two isolated nodes
+ /// is \e not bi-node-connected and
+ /// \li a graph consisting of two nodes connected by an edge
+ /// is bi-node-connected.
///
/// \see countBiNodeConnectedComponents(), biNodeConnectedComponents()