Let G be a simple graph with n(G) > 2. Prove that G is
2-connected iff for every set of 3 distinct vertices, a,
b and c, there is an a,c-path
that contains b.
Coins can be redeemed for fabulous
Get Answers For Free
Most questions answered within 1 hours.