SeokHee Hong, Drawing Graphs Symmetrically in Three Dimensions, Proceeding of GD01, LNCS 2265, Springer Verlag, pp. 189204, 2002.
In this paper, we investigate symmetric graph drawing in three dimensions. We show that the problem of drawing a graph with a maximum number of symmetries in three dimensions is NPhard. Then we present a polynomial time algorithm for finding maximum number of three dimensional symmetries in planar graphs.
