On Mon, 19 Jun 2023 at 14:27, Dima Pasechnik wrote:
> One can do something like this; start from your graph G, take
> D=G.planar_dual(), in D take a spanning tree, and starting from the
> root of the tree,
> and orientation chosen in the face corresponding to the root, proceed
> recursively to in
One can do something like this; start from your graph G, take
D=G.planar_dual(), in D take a spanning tree, and starting from the
root of the tree,
and orientation chosen in the face corresponding to the root, proceed
recursively to induce orientations on the adjacent faces.
On Mon, Jun 19, 2023
oh, right, what I suggested isn't what you asked for, sorry.
On Mon, 19 Jun 2023, 13:56 John Cremona, wrote:
> Thanks Dima for the suggestion. I'm not sure that this does what I need:
> the associated directed graph has each edge directed, which is not what I
> was needing, and the faces of th
Thanks Dima for the suggestion. I'm not sure that this does what I need:
the associated directed graph has each edge directed, which is not what I
was needing, and the faces of the directed graph look identical to those of
the original -- in particular, the edges of each face are tuples (x,y)
On Mon, Jun 19, 2023 at 11:18 AM John Cremona wrote:
>
> I have some quite small graphs which are polyhedral, each is the 1-skeleton
> of a (connected convex) polyhedron such as a cube, tetrahedron, etc,
> constructed from a list of edge pairs.
>
> I can get the faces of one of these, say G, via
I have some quite small graphs which are polyhedral, each is the 1-skeleton
of a (connected convex) polyhedron such as a cube, tetrahedron, etc,
constructed from a list of edge pairs.
I can get the faces of one of these, say G, via G.faces(). This returns a
list of lists of vertices, each one bei
