### Abstract

Original language | English |
---|---|

Pages (from-to) | 41-50 |

Number of pages | 10 |

Journal | Discrete Mathematics |

Volume | 25 |

Issue number | 1 |

DOIs | |

Publication status | Published - 1979 |

### Fingerprint

### Cite this

*Discrete Mathematics*,

*25*(1), 41-50. https://doi.org/10.1016/0012-365X(79)90151-1

}

*Discrete Mathematics*, vol. 25, no. 1, pp. 41-50. https://doi.org/10.1016/0012-365X(79)90151-1

**Median graphs and Helly subgraphs.** / Mulder, H.M.; Schrijver, A.

Research output: Contribution to journal › Article › Academic › peer-review

TY - JOUR

T1 - Median graphs and Helly subgraphs

AU - Mulder, H.M.

AU - Schrijver, A.

PY - 1979

Y1 - 1979

N2 - One-to-one correspondences are established between the following combinatorial structures: (i) median interval structures (or median segments, introduced by Sholander); (ii) maximaL Helly hypergraphs such that with each edge also its complement is in the hypergraph; and (iii) median graphs (connected graphs such that for any three vertices u, v, w there is exactly one vertex x such that d(u,¿) = d(u,x)+d(x,¿), d(¿,w) = d(¿,x)+d(x,w) and d(w, u) = d(w,x)+ d(x, u), where d is the distance function of the graph).

AB - One-to-one correspondences are established between the following combinatorial structures: (i) median interval structures (or median segments, introduced by Sholander); (ii) maximaL Helly hypergraphs such that with each edge also its complement is in the hypergraph; and (iii) median graphs (connected graphs such that for any three vertices u, v, w there is exactly one vertex x such that d(u,¿) = d(u,x)+d(x,¿), d(¿,w) = d(¿,x)+d(x,w) and d(w, u) = d(w,x)+ d(x, u), where d is the distance function of the graph).

U2 - 10.1016/0012-365X(79)90151-1

DO - 10.1016/0012-365X(79)90151-1

M3 - Article

VL - 25

SP - 41

EP - 50

JO - Discrete Mathematics

JF - Discrete Mathematics

SN - 0012-365X

IS - 1

ER -