A chorded cycle is a planar graph which begins with a cycle and then adds non-crossing edges.
Fantastic news! We've Found the answer you've been seeking!
Question:
A chorded cycle is a planar graph which begins with a cycle and then adds non-crossing edges. An example of a chorded cycle is shown below.
Using strong induction on the number vertices, prove the following claim.
Claim. If G is a chorded cycle on n ? 3 vertices, then x(G) ? 3.
Related Book For
Essentials of Statistics for the Behavioral Sciences
ISBN: 978-1285056340
8th Edition
Authors: Frederick J Gravetter, Larry B. Wallnau
Posted Date: