We characterize the (weak) Cartesian products of trees among median gr
aphs by a forbidden 5-vertex convex subgraph. The number of tree facto
rs (if finite) is half the length of a largest isometric cycle. Then a
characterization of Cartesian products of n trees obtains in terms of
isometric cycles and intervals. Finally we investigate to what extent
the proper intervals determine the product structure. (C) 1996 John W
iley & Sons, Inc.