Generating the List of Spanning Trees in $K_{s,t}$

Abstract

The formula for the number of spanning trees in $K_{t_1,\dots ,t_P}$ is well known. In this paper, we give an algorithm that generates the list of spanning trees in $K_{s,t}$.