Assertion: median graph | /r/HasProperty | pair
Facets:
Source sentences:
text: In some sense median graphs are characterized as coming from Helly split systems: the pairs (W uv , W vu ) defined for each edge uv of a median graph form a Helly split system, so if one applies the Buneman graph construction to this system no latent vertices will be needed and the result will be the same as the starting graph.