First time here? Check out the FAQ!
posted Jul 30 '12
Prove that every connected $k$-regular bipartite graph on at least three vertices is 2-connected.
Posted: Jul 30 '12
Seen: 63 times
Last updated: Jul 30 '12
Connectivity of cubic graphs
Covering complete graph with bipartite graphs
Basics of Perfect Graphs
Lonely edges in bipartite graphs
Cycle in k-connected graphs
Matching saturating high degree vertices
Basics of bipartite graphs
Properties of Petersen Graph
Regular bipartite super-graph
2-connectivity and bipartite minors
Graceful Tree Conjecture
