#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):
No, but there is a `G.edge_connectivity()`, so just use that and check
that it is at least 3. Probably something more efficient is possible when
we just want to know whether it is at least 3, but for now you can just
use that.
--
Ticket URL: <http://trac.sagemath.org/ticket/6236#comment:12>
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.
