Digraphs
Digraphs copied to clipboard
digraphs
The GAP package Digraphs
I don't think it is sufficiently easy to find out which of the four main digraph encoding formats apply to which kinds of digraphs. I'm talking about `(di)sparse6` and `(di)graph6`....
This would do the same thing as the usual `on: push` and `on: pr` workflows, except that instead of using the checkout of Digraphs corresponding to the pushed branch or...
We observed the following: 
See https://en.wikipedia.org/wiki/Cograph#Other_characterizations for several equivalent definitions. The simplest seems to be 'graph (i.e. symmetric digraph) that doesn't contain the 4-vertex path graph as a subgraph'. I don't know how hard...
Trying the following, edge labels were not removed from the Digraph when an edge was removed ``` gap> D := DigraphByEdges(IsMutableDigraph, [[1, 2], [2, 3], [3, 4], [4, 1], [1,...
Currently we `malloc` and blithely assume that it succeeds. Usually it does (at least on 64-bit), but it doesn't necessarily succeed, and it is more likely to fail on 32-bit...
...particularly in the Schreier-Sims implementation. @ChrisJefferson reported in https://github.com/semigroups/Semigroups/issues/634#issuecomment-790661632 that when using the homomorphism finder for the first time, Digraphs allocates 1.25 GB of memory, and that moreover, this memory...
Add Zykov and Christofides Algorithms for Chromatic Number. This builds on the previous pull request #382 to add two additional algorithms for calculating the Chromatic Number. These use the same...
We already stopped adding new methods for multidigraphs, the main issue is that there is no way to distinguish between the multiple edges. To address this I propose removing support...
As the title says, it'd be good to have a function that computed all the quotients of a given digraph. I'm not sure how feasible this is really, but it'd...