A note on covering the edges of a graph with bonds (Q1292867): Difference between revisions

This paper concentrates to prove the following result: If \(G\) is a 2-connected graph with circumference \(c\), then there are \(c\) bonds \(B_1,B_2,\dots, B_c\) of \(G\), not necessarily different, such that every edge of \(G\) lies in at least two of them. This result is stronger than the one proved by Wu Pou-Lin saying that if \(G\) is a 2-connected graph with circumference \(c\), then \(cc'\geq 2| E(G)|\), where \(c'\) is the size of the largest bonds of \(G\).