  A set of vertices X of a graph G is convex if it contains all vertices on
shortest paths between vertices of X. We prove that for fixed p, all partitions
of the vertex set of a bipartite graph into p convex sets can be found in
polynomial time.
