:-) 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
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:
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 unsub
- 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 gr
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
I agree with you..I was replying to
kunzmilan:
> Planarity can be defined differently. Graph K(4) Can be drawn without crossing
> arcs. Newertheless, as tetrahedron, it is not planar. To both forms, different
> distance matrices belong.
--~--~-~--~~~---~--~~
You re
what's the problem?!
K4 does not contain K3,3 or K5 => K4 is planar!
On Tue, Mar 25, 2008 at 5:42 PM, Karthik Singaram Lakshmanan <
[EMAIL PROTECTED]> wrote:
>
> K4 is planar
> http://en.wikipedia.org/wiki/Planar_graph
>
> >
>
--~--~-~--~~~---~--~~
You received
K4 is planar
http://en.wikipedia.org/wiki/Planar_graph
--~--~-~--~~~---~--~~
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
On 24 Bře, 11:18, "nima aghdaie" <[EMAIL PROTECTED]> wrote:
> A graph is planar iff it does not contain K5 and K3,3 .
> read chapter 6 (Planar Graphs) from "Introduction to Graph Theory", Douglas
> B. West
>
> Planarity can be defined differently. Graph K(4) Can be drawn without crossing
> arcs
A graph is planar iff it does not contain K5 and K3,3 .
read chapter 6 (Planar Graphs) from "Introduction to Graph Theory", Douglas
B. West
2008/3/24 kunzmilan <[EMAIL PROTECTED]>:
>
>
>
> On 17 Bře, 10:38, sp1 <[EMAIL PROTECTED]> wrote:
> > How to test an given graph is plannar?
> > The answer
On 17 Bře, 10:38, sp1 <[EMAIL PROTECTED]> wrote:
> How to test an given graph is plannar?
> The answer gives its distance matrix. When distances between vertices
> of the graph are squared, the distance matrix of a plannar graph has
> only 4 nonzero eigenvalues.
kunzmilan
--~--~-~--~
14 matches
Mail list logo
