  This is a companion note to our paper 'Some advances on Sidorenko's
conjecture', elaborating on a remark in that paper that the approach which
proves Sidorenko's conjecture for strongly tree-decomposable graphs may be
extended to a broader class, comparable to that given in work of Szegedy,
through further iteration.
