Ask your own question, for FREE!
Mathematics 8 Online
OpenStudy (anonymous):

Let G be a planar graph with no K3 subgraph. Prove G is 4 colourable.

OpenStudy (anonymous):

K3 is a graph with 3 vertices that are all adjacent to each other.

OpenStudy (anonymous):

What confuses me is wouldn't this be not true for a graph that a graph like that is a counter example I think |dw:1395811041797:dw|

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!