A bipartite graph can be labeled so all vertices of a given class are contiguous. This method does precisely that to a bipartite graph.
R = QQ[a..f]; |
G = graph flatten apply({a,c,e}, v->v*{b,d,f}) |
relabelBipartite G |
If any of the inputs are not bipartite graphs, then the method throws an error.