Minimal cycle bases of the lexigraphic product of graphs
From MaRDI portal
Publication:3606452
DOI10.7151/dmgt.1403zbMath1156.05030OpenAlexW2094188567MaRDI QIDQ3606452
Publication date: 26 February 2009
Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7151/dmgt.1403
Paths and cycles (05C38) Combinatorial aspects of matroids and geometric lattices (05B35) Structural characterization of families of graphs (05C75)
Related Items
Robust cycle bases do not exist for \(K_{n, n}\) if \(n \geq 8\) ⋮ Convex sets in lexicographic products of graphs
This page was built for publication: Minimal cycle bases of the lexigraphic product of graphs