A triangle is a planar graph with vertix less than 5 degree. A vertice with n other vertices connect to it (so have degree n) is a planar graph.
So we may have planar graphs where all vertex has degree less than 5, and planar graphs with n vertex with degree more than 5. On Thu, Apr 3, 2008 at 8:01 PM, Karthik Singaram Lakshmanan < [EMAIL PROTECTED]> wrote: > > Correct that to : There exists at least one vertex of degree at most 5 > > > > --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
