#9136: more named graphs
--------------------------------+-------------------------------------------
Reporter: mvngu | Owner: jason, ncohen, rlm
Type: enhancement | Status: new
Priority: major | Milestone: sage-wishlist
Component: graph theory | Resolution:
Keywords: | Work issues:
Report Upstream: N/A | Reviewers:
Authors: | Merged in:
Dependencies: | Stopgaps:
--------------------------------+-------------------------------------------
Comment (by nvcleemp):
Replying to [comment:14 dimpase]:
> Fullerens are in fact a family, that can be generated.
> G.Brinkmann wrote a program called fullgen
> http://cs.anu.edu.au/~bdm/plantri/
> that does just this, generating all non-isomorphic fullerens with given
number of
> hexagonal faces. Unfortunately it has a weird license, so it cannot be
just hooked up to Sage, at least not in a standard package.
Brinkmann's student J. Goedgebeur implemented a new version using a
different algorithm which is faster for the `small' cases:
http://caagt.ugent.be/buckygen/ This program is available under the GPL,
so I assume it can be integrated in Sage. I'm willing to work on this. I
have some familiarity with the program, since I integrated it into !CaGe
(http://caagt.ugent.be/CaGe).
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/9136#comment:40>
Sage <http://www.sagemath.org>
Sage: Creating a Viable Open Source Alternative to Magma, Maple, Mathematica,
and MATLAB
--
You received this message because you are subscribed to the Google Groups
"sage-trac" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
To post to this group, send email to [email protected].
Visit this group at http://groups.google.com/group/sage-trac?hl=en.
For more options, visit https://groups.google.com/groups/opt_out.
