:-) Forgot what i said, i'm drunk. :-). I was thinking about Euler circuit,
where we must have a graph where each of its vertices has even degree.
Sorry.
For planar graph see:
http://en.wikipedia.org/wiki/Planar_graph
On Fri, Apr 4, 2008 at 9:09 AM, Deepak Manohar <[EMAIL PROTECTED]>
wrote:
> E
Every graph would contain even number of odd degree vertices.
On Fri, Apr 4, 2008 at 5:32 PM, Douglas Diniz <[EMAIL PROTECTED]> wrote:
> If I remember a planar graph must have a even number of vertex with odd
> degree.
>
> On Fri, Apr 4, 2008 at 8:44 AM, kunzmilan <[EMAIL PROTECTED]> wrote:
>
> >
If I remember a planar graph must have a even number of vertex with odd
degree.
On Fri, Apr 4, 2008 at 8:44 AM, kunzmilan <[EMAIL PROTECTED]> wrote:
>
>
>
> On 4 Dub, 02:14, "Douglas Diniz" <[EMAIL PROTECTED]> wrote:
> > A triangle is a planar graph with vertix less than 5 degree.
> > A vertice w
On 4 Dub, 02:14, "Douglas Diniz" <[EMAIL PROTECTED]> wrote:
> 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
> plana
