The number of nets of the regular convex polytopes in dimension <= 4

Abstract Classifying the nets (also called unfoldings or developments or patterns) of the regular convex polytopes under the isometry group of the polytope is equivalent to classifying the spanning trees of the facet-adjacency graph under its automorphism group. This is done for all such polytopes of dimension at most 4.