Talk:Connectivity (graph theory)

From Wikipedia, the free encyclopedia

Could somebody kindly provide information on different categories of connectivity, such as 'weakly connected graph', 'strongly connected graph' etc..?

As I understand it, these two terms refer to directed graphs; I've added the definitions I know.JLeander 23:47, 2 February 2006 (UTC)

[edit] Figures

It would be nice to have some figures in here, wouldn't it? Maybe I will cook some up at some point using xfig.JLeander 23:47, 2 February 2006 (UTC)

[edit] Fulkerson's theorem

An earlier version of the page had a reference to "Fulkerson's theorem." My MathSciNet search didn't turn up any appropriate result known by this name. My guess is that the previous editor had max-flow/min-cut in mind---or am I missing something?JLeander 23:47, 2 February 2006 (UTC)