Digraphs
Digraphs copied to clipboard
digraphs
The GAP package Digraphs
A digraph is vertex transitive if its automorphism group acts transitively on its vertices, and it is arc transitive if its automorphism group acts transitively on its arcs. This can...
Currently, `ChromaticNumber` does a linear search for the chromatic number. It'd be much better if it did a binary search.
It would be cool if we could make the digraphs package compatible with the francy package: https://github.com/gap-packages/francy
The following leads to a crash on my Windows 10 Home HP Pavilion Pentium 4415U 4GB laptop. GAP was installed using the gap-4.10.2.exe installer. I think the problem is in...
In PR #186 we introduced the ability to compute edge-coloured automorphisms. We should also introduce edge-coloured canonical labelling and isomorphisms.
`RepresentativeAction(G, D1, D2)` and `RepresentativeAction(G, D1, D2, OnDigraphs)` should return an element `g` of the permutation group `G` that maps `D1` to `D2`, i.e. `OnDigraphs(D1, g) = D2`. For `G...
@ChrisJefferson suggested this as a possibly good idea in https://github.com/semigroups/Semigroups/issues/634#issuecomment-790667663. Memory is severely limited on 32-bit mode, and with `MAXVERTS = 512`, Digraphs can apparently end up being quite demanding...
It'd be a useful feature to be able to create a join semilattice (digraph) from its join table (and the same for meets).
Definition: https://en.wikipedia.org/wiki/Perfect_graph I have no idea how hard this might be. I also don't know whether there is a sensible notion for arbitrary digraphs, rather than just 'graphs' (i.e. symmetric...
Currently these are separate steps. But I think that (for convenience and efficiency reasons) these should be able to be combined into a single step. An incomplete list of the...