In this paper we investigate the graphs that are obtained from single edges and even cycles by successive gated amalgamations. These 'cellular' graphs are characterized among bipartite graphs by having a totally decomposable shortest-path metric, and can be recognized by a quadratic time algorithm. (C) 1996 Academic Press Limited