#18972: twographs and Seidel switching
-------------------------------------+-------------------------------------
Reporter: dimpase | Owner:
Type: enhancement | Status: needs_work
Priority: major | Milestone: sage-6.9
Component: graph theory | Resolution:
Keywords: | Merged in:
Authors: | Reviewers:
Report Upstream: N/A | Work issues:
Branch: | Commit:
u/dimpase/seidelsw | a89a02a24b44fd0b2ce1c92ecce22b672bbd9e21
Dependencies: #18960, #18948, | Stopgaps:
#18988 |
-------------------------------------+-------------------------------------
Comment (by ncohen):
Is there a general way to *guess* how those 2-graph entries are produced?
Couldn't we turn this construction into something automatic? Or will those
2-graph construction all have to be added manually to the list?
--
Ticket URL: <http://trac.sagemath.org/ticket/18972#comment:35>
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.
For more options, visit https://groups.google.com/d/optout.
