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. Newertheless, as tetrahedron, it is not planar. To both forms, different
> distance matrices belong.
kunzmilan
--~--~---------~--~----~------------~-------~--~----~
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to [email protected]
To unsubscribe from this group, send email to [EMAIL PROTECTED]
For more options, visit this group at http://groups.google.com/group/algogeeks
-~----------~----~----~----~------~----~------~--~---
