How many cycle-free connected graphs are there on n vertices, none of which has degree >m?
e.g for m=1 there is 1 graph for n=1,2, 0 otherwise. For m=2 there is always 1 graph.
I am particularly interested in the m=4 case, as I was originally trying to count isomers of straight-chain alkanes.