Question: Recall that a bipartite graph has the property that the vertices can be grouped into two parts so that neither part has internal edges. A complete bipartite graph Km,n has all possible edges between a part with n vertices and a part with m vertices.
![166_49.png](https://secure.tutorsglobe.com/CMSImages/166_49.png)