Cartesian products of trees and paths
Hans-J�rgen Bandelt, Gustav Burosch, Jean-Marie Laborde · Journal of Graph Theory · 1996
We characterize the (weak) Cartesian products of trees among median graphs by a forbidden 5-vertex convex subgraph. The number of tree factors (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. © 1996 John Wiley & Sons, Inc.