[Date Index] [Thread Index] [Author Index]
Re: How do I make Combinatorica graphs of publishable quality?
Henning Heiberg-Andersen wrote: >Hi, > >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. http://library.wolfram.com/infocenter/MathSource/4775/ 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 >integer length. > > 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 >Mathematica? > > 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. http://mathworld.wolfram.com/topics/GraphTheory.html http://library.wolfram.com/infocenter/MathSource/4775/ >Best regards, >Henning Heiberg-Andersen > > Ed Pegg Jr, www.wolfram.com