In the
mathematical field of
graph theory, a
convex bipartite graph is a
bipartite graph with specific properties. A bipartite graph, (
U ∪
V,
E), is said to be convex over the vertex set
U if
U can be
enumerated such that for all
v ∈
V the vertices adjacent to
v are consecutive.