Convex subgraphs and spanning trees of the square cycles

Abstract

We classify connected spanning convex subgraphs of the square cycles. We then show that every spanning tree of C 2 n is contained in a unique nontrivial connected spanning convex subgraph of C 2 n . As a result, we obtain a purely combinatorial derivation of the formula for the number of spanning trees of the square cycles.