Minimum cycle bases of lexicographic products
DOI:
https://doi.org/10.26493/1855-3974.172.8a7Keywords:
Cycle space, Cycle basis, lexicographic productAbstract
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.Downloads
Published
2012-03-06
Issue
Section
Articles
License
Articles in this journal are published under Creative Commons Attribution 4.0 International License
https://creativecommons.org/licenses/by/4.0/