Ask your own question, for FREE!
Discrete Math 19 Online
OpenStudy (anonymous):

Suppose G is a simple undirected planar graph. Prove that G contains a vertex with degree at most 5.

OpenStudy (experimentx):

OpenStudy (experimentx):

Ge ge works Ctrl + F "Corollary 3.3"

OpenStudy (anonymous):

You cheat again :\

OpenStudy (experimentx):

probably it was mean to ask that ... there exists no planar graph with all vertices having degree more than 5 Haha ... :D

OpenStudy (anonymous):

CHEAT CHEAT CHEAT! But thanks though :D

OpenStudy (experimentx):

yw!! try asking on M.SE for interpretation ... still I am not clear.

OpenStudy (experimentx):

|dw:1387299426873:dw| degree 6

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!