Abstract
Minimum cycle bases of product graphs can in most situations be constructedfrom minimum cycle bases of the factors together with a suitable collectionof triangles and/or quadrangles determined by the product operation. Herewe give an explicit construction for the lexicographic product G o H that generalizes results by Berger and Jaradat to the case that H is notconnected.
Citation
[HOS12] Hellmuth, M., Ostermeier, L., Stadler, P.F.,
Minimum Cycle Bases of Lexicographic Products,
Ars Math. Contemporanea, 5, 2, 219–230, 2012
