Return to search

Convex Cycle Bases

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.

Identiferoai:union.ndltd.org:VIENNA/oai:epub.wu-wien.ac.at:6468
Date January 2014
CreatorsHellmuth, Marc, Leydold, Josef, Stadler, Peter F.
PublisherDMFA Slovenije
Source SetsWirtschaftsuniversität Wien
LanguageEnglish
Detected LanguageEnglish
TypeArticle, PeerReviewed
Formatapplication/pdf
RightsCreative Commons: Attribution 3.0 Austria
Relationhttp://amc-journal.eu/index.php/amc/article/view/226, https://www.dmfa.si/, https://amc-journal.eu/index.php/amc/index, https://amc-journal.eu/index.php/amc/about/submissions#copyrightNotice, http://epub.wu.ac.at/6468/

Page generated in 0.0016 seconds