Re: How do I make Combinatorica graphs of publishable quality?
- To: mathgroup at smc.vnet.net
- Subject: [mg44145] Re: [mg44130] How do I make Combinatorica graphs of publishable quality?
- From: Ed Pegg Jr <edp at wolfram.com>
- Date: Fri, 24 Oct 2003 04:24:14 -0400 (EDT)
- References: <200310231116.HAA23862@smc.vnet.net>
- Sender: owner-wri-mathgroup at wolfram.com
Henning Heiberg-Andersen wrote:
>As far as I can see, Combinatorica doesn't provide any
>embedding algorithms for planar graphs; the built-in
>options give line-crossing.
I'd like that, too. As a hobby, I've made some programs for Graphs,
you can see them in Eric Weisstein's Mathworld packages.
For awhile, I've wanted to make Schlegel diagrams of the 257
convex octahedra -- the algorithm is in Handbook of Discrete
and Computational Geometry (and elsewhere). But I haven't
coded it in, yet. If someone does, let me or Eric know.
>It would be useful to have
>an automatic upgrade of the graphs generated by the
>drawing tools of Combinatorica, for example demanding all the edges to be of
There is no known integer length embedding of K8, except a straight
line. See Unsolved Problems in Geometry by R K Guy. I agree
this would be useful, but the problem is in general unsolvable.
>Does anybody know about such algorithms written in
>Mathematica, or relevant external programs that communicates well with
See Eric Weisstein's Mathworld packages, first. In Mathworld,
look at what he has on Graphs. At the top of many pages he
gives his own generating programs for that page.
Ed Pegg Jr, www.wolfram.com
Prev by Date:
errors while picking random numbers under constraint and in loop also
Next by Date:
Re: NDSolve does not work in shooting method
Previous by thread:
How do I make Combinatorica graphs of publishable quality?
Next by thread:
Re: Re: How do I make Combinatorica graphs of publishable quality?