Convex cycle bases
Keywords:cycle basis, convex subgraph, isometric subgraph, Cartesian product, partial cubes
AbstractConvex cycles play a role e.g. in the context of product graphs. We introduce convex cycle bases and describe a polynomial-time algorithm that recognizes whether a given graph has a convex cycle basis and provides an explicit construction in the positive case. Relations between convex cycles bases and other types of cycles bases are discussed. In particular we show that if G has a unique minimal cycle bases, this basis is convex. Furthermore, we characterize a class of graphs with convex cycles bases that includes partial cubes and hence median graphs.
Special Issue Bled'11
Articles in this journal are published under Creative Commons Attribution 4.0 International License