26. Find a family of graphs, none of which has a Hamiltonian circuit but for which adding a single edge to the first graph in the family creates a Hamiltonian circuit, adding two edges to the second graph in the family creates a Hamiltonian circuit, and so forth.