We present an n-processor and O(lo~n)-time parallel RAM algorithm for finding a depth-first-search tree in an n·vertex planar graph. The algorithm is based on a new n-processor algorithm for finding a cyclic separator in a planar graph and Smith's original parallel depth-first-search algorithm for planar graphs [Smi86].