First time here? Check out the FAQ!
Jul 05 '12
Prove that every $k$-connected graph ($k > 1$) on at least $2k$ vertices has a cycle of length at least $2k$.
Posted: Jul 05 '12
Seen: 65 times
Last updated: Jul 22 '12
Connectivity of cubic graphs
Properties of Petersen Graph
k-regular bipartite graphs are 2-connected
2-connectivity and bipartite minors
Basics of Connectivity
Halin's theorem and Mader's theorem
Minimum Flip Connectivity Problem
Edge connectivity vs Strong connectivity
Minimum edge cover vs Maximum matching
Graceful Tree Conjecture