MeikeWeiss

Wrong output `SubdigraphsMonomorphisms`

3

I have the graph ~~~ d:=Digraph([ [ 2, 3, 4, 5 ], [ 1, 3, 4 ], [ 1, 2, 4, 5 ], [ 1, 2, 3, 5 ], [...

Implement `FacialCycles` and `DualGraph`

1

I have already an implementation of a method that computes for a digraph and a rotation system the facial cycles (no matter whether the graph is planar or not) and...

Sometimes it is helpful to work with graphs that allow a non-dense vertex list. For instance, if I remove a vertex I would like to have still the old names....

Include graph embedding method from C code

3

Gunnar Brinkmann wrote some really nice C code for computing all orientable non-isomorphic embeddings of given graphs and given genus (or computing the minimal genus). The C code based on...