Abstract
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 ≥5 is quasi-robust but not robust. We furthermore disprove a conjecture for cycle bases of Cartesian product graphs.
Originalsprache | Englisch |
---|---|
Seiten (von - bis) | 213 - 240 |
Fachzeitschrift | Ars Mathematica Contemporanea |
Jahrgang | 2 |
Publikationsstatus | Veröffentlicht - 1 Aug. 2009 |