Re: Slightly off-topic - digraph layout algorithms

dj3vande@eskimo.com
Mon, 4 May 2009 18:38:20 +0000 (UTC)

          From comp.compilers
Related articles
Slightly off-topic - digraph layout algorithms sh006d3592@blueyonder.co.uk (Stephen Horne) (2009-04-13)
Re: Slightly off-topic - digraph layout algorithms DrDiettrich1@aol.com (Hans-Peter Diettrich) (2009-04-14)
Re: Slightly off-topic - digraph layout algorithms sh006d3592@blueyonder.co.uk (Stephen Horne) (2009-04-16)
Re: Slightly off-topic - digraph layout algorithms sh006d3592@blueyonder.co.uk (Stephen Horne) (2009-05-03)
Re: Slightly off-topic - digraph layout algorithms dj3vande@eskimo.com (2009-05-04)
Re: Slightly off-topic - digraph layout algorithms bear@sonic.net (Ray Dillinger) (2009-05-05)
| List of all articles for this month |
From: dj3vande@eskimo.com
Newsgroups: comp.compilers
Date: Mon, 4 May 2009 18:38:20 +0000 (UTC)
Organization: I should work on that
References: 09-04-017 09-05-014
Keywords: tools
Posted-Date: 05 May 2009 10:49:40 EDT
X-Better-Address: Same username at eskimo.com

In article 09-05-014,
Stephen Horne <sh006d3592@blueyonder.co.uk> wrote:


>BTW - am I correct in believing that a graph that can be coloured
>using four or fewer colours can always be drawn (in 2D) with no arcs
>crossing?


No.
K(3,3) (two triples of vertices, with each vertex in each triple having
edges to all three vertices in the other triple) can be colored with 2
colors, but doesn't have a planar embedding.




dave


--
Dave Vandervies dj3vande at eskimo dot com
Well, it's logically consistent and interesting. That appears to be
all mathematicians need.
                                                  --James Riden in the scary devil monastery


Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.