---
tag: 7CCQTNR1D1
kind: concept
name: Convex bipartite graph
aliases: [biconvex-bipartite-graph, convex-bigraph, doubly-convex-bipartite-graph]
sources:
  - wikipedia: en:23674225@r1351781114
    locator: Convex bipartite graph
    note: adopted
    mention: wikipedia://en/23674225
    sections: [Summary]
same_as:
  wikidata: Q5166515
  wikipedia: Convex bipartite graph
inventory: [AJGWGQQWEY]
---

## Summary

In the mathematical field of graph theory, a **convex bipartite graph** is a [[bipartite graph|07DVHJ8N0A]] 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**.