Oracle FAQ Your Portal to the Oracle Knowledge Grid
HOME | ASK QUESTION | ADD INFO | SEARCH | E-MAIL US
 

Home -> Community -> Usenet -> comp.databases.theory -> Re: dual graph

Re: dual graph

From: Dmitry A. Kazakov <mailbox_at_dmitry-kazakov.de>
Date: Mon, 26 Jun 2006 14:04:28 +0200
Message-ID: <1hw0e5m3oyexo$.1jhjjcxz20jqa.dlg@40tude.net>


On Mon, 26 Jun 2006 11:34:59 GMT, David Cressey wrote:

> Now, I'm interested in a a subset of the planar graphs.
>
> It's the graphs that don't divide the space into more than one region.
>
> It seems to me that it's appropriate to call such graphs "hierarchical
> graphs", or simply "hierarchies". But I'm not sure. Can anyone clear this
> up?

'Ordered graph' is the technical term, IMO.

-- 
Regards,
Dmitry A. Kazakov
http://www.dmitry-kazakov.de
Received on Mon Jun 26 2006 - 07:04:28 CDT

Original text of this message

HOME | ASK QUESTION | ADD INFO | SEARCH | E-MAIL US