Characterizing almost-median graphs

Authors:
Boštjan Brešar
Affiliations:
University of Maribor, FERI, Smetanova 17, 2000 Maribor, Slovenia
Venue:
European Journal of Combinatorics
Year:
2007

Citing 6
Cited 1

Quasi-median graphs and algebras

Journal of Graph Theory
A convexity lemma and expansion procedures for bipartite graphs

European Journal of Combinatorics
Partial hamming graphs and expansion procedures

Discrete Mathematics
Quasi-median graphs, their generalizations, and tree-like equalities

European Journal of Combinatorics
Fast recognition algorithms for classes of partial cubes

Discrete Applied Mathematics - Special issue: The second international colloquium, "journées de l'informatique messine"
Tiled partial cubes

Journal of Graph Theory

Asymptotic number of isometric generalized Fibonacci cubes

European Journal of Combinatorics

Quantified Score

Hi-index	0.00

Visualization

Abstract

Almost-median and semi-median graphs are two natural generalizations of the well-known class of median graphs. In this note we prove that a semi-median graph is almost-median if and only if it does not contain any convex cycle of length greater than four.