113-120 05C75 Cartesian products of trees and paths. Powers of distance-hereditary graphs. Three interval conditions for graphs. Cellular bipartite graphs. Minimum transversals of maximum matchings as approximate solutions to the bisection problem.
Symmetric matrices representable by weighted trees over a cancellative abelian monoid.
An order-theoretic framework for overlapping clustering. Quasi-median graphs and algebras. Pseudo-median graphs are join spaces. Absolute reflexive retracts and absolute bipartite retracts. Centroids and medians of finite metric spaces.