Let H and H' be two maximal k-connected subgraphs of a graph G. Prove that they have at most k-1 common vertices.
Follow Math Help Forum on Facebook and Google+
View Tag Cloud