In graph theory, a division of mathematics, a median graph is an undirected graph in which every three vertices , , and have a unique median: a vertex that belongs to shortest paths between each pair of , , and .

The concept of median graphs has long been studied, for instance by or (more explicitly) by , but the first paper