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,

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.