Recognizing pseudo-median graphs

doi:10.1016/S0166-218X(00)00327-9

Discrete Applied Mathematics

Volume 116, Issue 3, 15 February 2002, Pages 261-269

https://doi.org/10.1016/S0166-218X(00)00327-9 Get rights and content

Under an Elsevier user license

open archive

Abstract

Pseudo-median graphs form a nonbipartite generalization of median graphs. We derive a characterization of pseudo-median graphs based on a sequence of gated expansions which allows us to recognize these graphs in O(mn) time.

Keywords

Median graph

Pseudo-median graph

Algorithm

Cited by (0)

^☆: Supported by the Ministry of Science and Technology of Slovenia under the Grant 0101-P-504.

Discrete Applied Mathematics

Recognizing pseudo-median graphs☆

Abstract

Keywords