Minimum cycle bases of lexicographic products

Minimum cycle bases of product graphs can in most situations be constructed from minimum cycle bases of the factors together with a suitable collection of triangles and/or quadrangles determined by the product operation. Here we give an explicit construction for the lexicographic product G H that generalizes results by Berger and Jaradat to the case that H is not connected.