Convex 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. (authors' abstract) / Series: Research Report Series / Department of Statistics and Mathematics
| Identifer | oai:union.ndltd.org:VIENNA/oai:epub.wu-wien.ac.at:3785 |
| Date | January 2013 |
| Creators | Hellmuth, Marc, Leydold, Josef, Stadler, Peter F. |
| Publisher | WU Vienna University of Economics and Business |
| Source Sets | Wirtschaftsuniversität Wien |
| Language | English |
| Detected Language | English |
| Type | Paper, NonPeerReviewed |
| Format | application/pdf |
| Relation | http://epub.wu.ac.at/3785/ |
Page generated in 0.0025 seconds