Let G be a planar graph on n vertices in total Suppose that along the outermost face of G are 4 vertices x,y,x,y appearing in that order Prove that there is a set of at most n 2 vertices in G that either separates x from x or separates y from y

Question

Let G be a planar graph on n vertices in total  Suppose that along the outermost face of G are 4 vertices x,y,x,y appearing in that order  Prove that there is a set of at most n   2 vertices in G that either separates x from x or separates y from y

SolutionInn · Accepted Answer

The Answer is in the image, click to view ...

Question: Let G be a planar graph on n vertices in total. Suppose that along the outermost face of G are 4 vertices x,y,x,y appearing in

Step by Step Solution