Tuffley CP2012-102012-10Australasian Journal of Combinatorics, 2012, 54 (2), pp. 189 - 206 (18)1034-4942https://hdl.handle.net/10179/12159We give a direct combinatorial proof of the known fact that the 3-cube has 384 spanning trees, using an "edge slide" operation on spanning trees. This gives an answer in the case n=3 to a question implicitly raised by Stanley. Our argument gives a bijective proof of the n=3 case of a weighted count of the spanning trees of the n-cube due to Martin and Reiner.189 - 206 (18)Journal article141752Massey_Dark0101 Pure Mathematics0103 Numerical and Computational Mathematics0802 Computation Theory and Mathematics