The coupled graph c(G) of a plane graph G is the graph defined on the vertex set V(G)boolean ORF(G) so that two vertices in c(G) are joined by an edge if and only if they are adjacent or incident in G. We prove that the coupled graph of a 2-connected plane graph is edge-pancyclic. However, there exists a 2-edge-connected plane graph G such that c(G) is not Hamiltonian. (C) 2002 Elsevier Science B.V. All rights reserved.