I.A.E., Université Jean Moulin (Lyon III), 15, quai Claude Bernard, 69239, Lyon Cedex 2, France
Abstract:
It is shown that a quasi-median graph G without isometric infinite paths contains a Hamming graph (i.e., a cartesian product of complete graphs) which is invariant under any automorphism of G, and moreover if G has no infinite path, then any contraction of G into itself stabilizes a finite Hamming graph.