A characterization of planar median graphs

@inproceedings{Peterin2004ACO,
  title={A characterization of planar median graphs},
  author={Iztok Peterin},
  year={2004}
}
Median graphs have many interesting properties. One of them is—in connection with triangle free graphs—the recognition complexity. In general the complexity is not very fast, but if we restrict to the planar case the recognition complexity becomes linear. Despite this fact, there is no characterization of planar median graphs in the literature. Here an additional condition is introduced for the convex expansion procedure that characterizes planar median graphs.