Minimum Grid Cutwidth of Complete Bipartite Graphs
Karl Quick · 2006
We shall determine the minimum grid cutwidth of the complete bipartite graph, Km,n, for m and n odd. We will also consider embedding the complete bipartite graph, Km,n, in grids with more than two rows. 1