Minimum cycle bases of lexicographic products

Marc Hellmuth, Philipp-Jens Ostermeier, Peter F. Stadler


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.


Cycle space, Cycle basis, lexicographic product

Full Text:



ISSN: 1855-3974

Issues from Vol 6, No 1 onward are partially supported by the Slovenian Research Agency from the Call for co-financing of scientific periodical publications