What is the matrix-tree theorem and its connection to random walks?

A The matrix-tree theorem counts random walk lengths B The number of spanning trees equals a Laplacian cofactor; this also equals the number of random walk cycles and connects to electrical resistance (effective resistance = 1/spanning trees) C Random walks on graphs are counted by the matrix-tree theorem D The theorem applies only to planar graphs