#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 ayyer):
> If the input graph is not 3-edge-connected, then the dual will not be a
simple plane graph, so no code will work for those graphs until we first
add support for plane multigraphs and plane graphs with loops.
Ah, I see! Thanks for explaining the issue. Can we write a program to
check for 3-edge-connectedness? If that is not too hard, then we can at
least include the dual graph method for a large class of graphs (and many
that other people are interested in). For graphs which fail that test, we
can leave a {{{NotImplemented}}} error. Does that seem doable?
--
Ticket URL: <http://trac.sagemath.org/ticket/6236#comment:9>
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.
