Definition 1. A plane embedding of is a placement of its vertices in together with continuous edge arcs satisfying (1).✦ Each arc is indexed by an ordered adjacent pair ; a hooked arrow denotes an injective map. (1)✦
A planar graph is a graph admitting a plane embedding, as in (2).✦ (2)✦
A three-vertex-connected graph is a finite graph with at least four vertices that remains connected after deleting any set of at most two vertices, as in (3).✦ (3)✦
A Hamiltonian graph is a graph containing a cycle through every vertex, as in (4).✦ For a walk , let be the set of vertices it visits, and let denote a closed walk based at . (4)✦