1.Previous
3.Next

complete bipartite graph has a maximum matching of size
*A complete bipartite graph has a proper {{mvar corresponding to a Latin square.
*Every complete bipartite graph is a modular graph: every triple of vertices has a median that belongs to shortest paths between each pair of vertices.

See also

* Biclique-free graph,

1.Previous
3.Next