- Degree of a vertex is at most 5. False.
On Mon, Mar 17, 2008 at 6:52 AM, Albert Sanchez <[EMAIL PROTECTED]> wrote: > There are some conditions a planar graph must fulfil: > > - Every planar graph is sparse. > - E <= 3V - 6. > - Degree of a vertex is at most 5. > - Every subgraph of a planar graph is, of course, planar. There's always a > sequence of low-degree vertices whose deletion eventually leaves the empty > graph. > > hope this help ;) > > > OuFeRRaT > > > > On Mon, Mar 17, 2008 at 10:38 AM, sp1 <[EMAIL PROTECTED]> wrote: > > > > > How to test an given graph is plannar? > > > > > > > > --~--~---------~--~----~------------~-------~--~----~ 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 -~----------~----~----~----~------~----~------~--~---
