Convex bipartite graph

Summary

In the mathematical field of graph theory, a convex bipartite graph is a bipartite graph with specific properties. A bipartite graph $(U \cup V, E)$ is said to be convex over the vertex set $U$ if $U$ can be enumerated such that for all $v \in V$, the vertices adjacent to $v$ are consecutive in the enumeration. Convexity over $V$ is defined analogously. A bipartite graph $(U \cup V, E)$ that is convex over both $U$ and $V$ is said to be biconvex or doubly convex.