In this article, we show that for any simple, bridgeless graph G on n vertices, there is a family C of at most n-1 cycles which cover the edges of G at least twice. A similar, dual result is also proven for cocycles namely: for any loopless graph G on n vertices and edges having cogirth g \* β₯ 3 and
β¦ LIBER β¦
Cycles and cocycles of fuzzy graphs
β Scribed by John N. Mordeson; Premchand S. Nair
- Publisher
- Elsevier Science
- Year
- 1996
- Tongue
- English
- Weight
- 488 KB
- Volume
- 90
- Category
- Article
- ISSN
- 0020-0255
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Cycle and cocycle coverings of graphs
β
Sean McGuinness
π
Article
π
2010
π
John Wiley and Sons
π
English
β 161 KB
Cycle-cocycle partitions and faithful cy
β
Henning Bruhn; Reinhard Diestel; Maya Stein
π
Article
π
2005
π
John Wiley and Sons
π
English
β 112 KB
## Abstract By a result of Gallai, every finite graph __G__ has a vertex partition into two parts each inducing an element of its cycle space. This fails for infinite graphs if, as usual, the cycle space is defined as the span of the edge sets of finite cycles in __G__. However, we show that, for t
On shortest cocycle covers of graphs
β
FranΓ§ois Jaeger; Abdelkader Khelladi; Michel Mollard
π
Article
π
1985
π
Elsevier Science
π
English
β 738 KB
Hamilton cycles and eigenvalues of graph
β
J. van den Heuvel
π
Article
π
1995
π
Elsevier Science
π
English
β 427 KB
Subthrackleable graphs and four cycles
β
B.L. Piazza; R.D. Ringeisen; S.K. Stueckle
π
Article
π
1994
π
Elsevier Science
π
English
β 645 KB
Hamilton cycles in random graphs and dir
β
Colin Cooper; Alan Frieze
π
Article
π
2000
π
John Wiley and Sons
π
English
β 266 KB
π 3 views