#6236: find the dual graph of a planar graph
--------------------------------+-------------------
Reporter: jason | Owner: rlm
Type: enhancement | Status: new
Priority: major | Milestone:
Component: graph theory | Resolution:
Keywords: | Merged in:
Authors: | Reviewers:
Report Upstream: N/A | Work issues:
Branch: | Commit:
Dependencies: | Stopgaps:
--------------------------------+-------------------
Comment (by nvcleemp):
The Platonic solids are 3-edge-connected. You need to have graphs with
minimum degree at least 3, because otherwise deleting the edges incident
to a vertex of minimum degree will disconnect the graph. Also have a look
at the methods added by #16970.
Creating a new branch and adding to the graph methods seems the best
approach. Be sure to read the developers guide.
--
Ticket URL: <http://trac.sagemath.org/ticket/6236#comment:14>
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.
