Talk:Biconnected graph

From Wikipedia, the free encyclopedia

Mathematics Portal This article is within the scope of WikiProject Mathematics, which collaborates on articles related to mathematics.
Mathematics rating:	Stub Class	Mid Priority	Field: Discrete mathematics
Please update this rating as the article progresses, or if the rating is inaccurate. Click to show/hide comments. Please add to or update the comments to suggest improvements to the article. Close to start: a bit more flesh on the bones needed... Geometry guy 00:53, 22 May 2007 (UTC)

[edit] Biconnected graph

"In other words, a biconnected graph is nonseparable, meaning if any edge were to be removed, the graph will remain connected." I changed "edge" to "vertex" because the original description doesn't hold in a graph with 2 vertices (which is, by definition, a biconnected graph). Kmote (talk) 20:18, 13 February 2008 (UTC)

[edit] Definition of an undirected biconnected graph

"A biconnected undirected graph G is a set of vertices V so that every vertex has at least two connecting edges (an adjacency list of at least size two), connecting to separate vertices other than itself."

Take the graph G(V, E), V = { A, B, C, D, E }, E = { AC, AE, BE, CE, DE, BD } doesn't 'every vertex have at least two connecting edges connecting to separate vertices other than itself"? And yet doesn't it also have an articulation vertex at E? Sahuagin (talk) 01:26, 8 December 2007 (UTC)

I agree. I removed that line. —David Eppstein (talk) 01:47, 8 December 2007 (UTC)