Editing Bipartite graph (section)

==See also==
*[[Bipartite dimension]], the minimum number of complete bipartite graphs whose union is the given graph
*[[Bipartite double cover]], a way of transforming any graph into a bipartite graph by doubling its vertices
*[[Bipartite hypergraph]], a generalization of bipartiteness to [[hypergraph]]s.
*[[Bipartite matroid]], a class of matroids that includes the [[graphic matroid]]s of bipartite graphs
*[[Bipartite network projection]], a weighting technique for compressing information about bipartite networks
*[[Convex bipartite graph]], a bipartite graph whose vertices can be ordered so that the vertex neighborhoods are contiguous
*[[Multipartite graph]], a generalization of bipartite graphs to more than two subsets of vertices
*[[Parity graph]], a generalization of bipartite graphs in which every two [[induced path]]s between the same two points have the same parity
*[[Quasi-bipartite graph]], a type of Steiner tree problem instance in which the terminals form an independent set, allowing approximation algorithms that generalize those for bipartite graphs
*[[Split graph]], a graph in which the vertices can be partitioned into two subsets, one of which is independent and the other of which is a clique
*[[Zarankiewicz problem]] on the maximum number of edges in a bipartite graph with forbidden subgraphs