Let G be a graph with six vertices (numbered 1,2,3,4,5, and 6) and nine edges: a cycle 1-2-3-4-5-6 and three diagonals 1-3, 3-6, and 4-6.

For the graph G, list the vertices in the order produced by a lexicographic breadth first search, starting from vertex 1.