Question:
Let G be a planar graph with 128 vertices and 378 edges,
Last updated: 8/7/2022
![Let G be a planar graph with 128 vertices and 378 edges,](https://media.kunduz.com/media/sug-question/raw/84150380-1659898064.0889127.jpeg?h=512)
Let G be a planar graph with 128 vertices and 378 edges, assuming that we colored 3 vertices located on the same face in green, and the rest in yellow, prove that it is possible to connect any pair of yellow vertices in a path that doesn't have any green vertices in it.