from Wiktionary, Creative Commons Attribution/Share-Alike License

  • adj. Describing a connected graph in which two vertices must be removed for it to become disconnected


bi- +‎ connected (Wiktionary)


  • For example, a graph has connectivity two or more if and only if it has no articulation points, that is, if and only if it is biconnected.

    Recently Uploaded Slideshows

  • Depth-first search is particularly useful in finding the biconnected components of a graph.

    Recently Uploaded Slideshows


Log in or sign up to get involved in the conversation. It's quick and easy.