Article ID Journal Published Year Pages File Type
4654720 European Journal of Combinatorics 2007 5 Pages PDF
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.

Keywords
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Authors
,