0 KB210 KB26 KB200820252009Hellmuth, MarcKlemm, KonstantinLeydold, JosefOstermeier, Philipp-JensStadler, Peter F.številka:2letnik:2str. 231-240COBISSID:15499097ISSN:1855-3966URN:URN:NBN:SI:doc-EGAR4SSCenDruštvo matematikov, fizikov in astronomov SlovenijeArs mathematica contemporaneaciklimatematikateorija grafovA note on quasi-robust cycle bases|We investigate here some aspects of cycle bases of undirected graphs that allow the iterative construction of all elementary cycles. We introduce the concept of quasi-robust bases as a generalization of the notion of robust bases and demonstrate that a certain class of bases of the complete bipartite graphs ?$K_{m,n}$? with ?$m,n \ge 5$? is quasi-robust but not robust. We furthermore disprove a conjecture for cycle bases of Cartesian product graphsTEXTznanstveno časopisjejournalsSlovenian National E-content AggregatorNational and University Library of SloveniaUniverza na Primorskem, Fakulteta za naravoslovje, matematiko in informacijske tehnologije