Given a planar graph (represented using adjacency lists) we want to find a set of vertices which are around one (random) face. We know that the graph contains at least one triangle.How do we find such a face?
Finding one face in planar graph
graph theory;planar graphs