1 paper
Jeffrey Gao, Paul C. Kainen
A permutation of the elements of a graph is a {\it construction sequence} if no edge is listed before either of its endpoints. The complexity of such a sequence is investigated by…