James Mitchell
James Mitchell
Currently, `ChromaticNumber` does a linear search for the chromatic number. It'd be much better if it did a binary search.
In PR #186 we introduced the ability to compute edge-coloured automorphisms. We should also introduce edge-coloured canonical labelling and isomorphisms.
It'd be a useful feature to be able to create a join semilattice (digraph) from its join table (and the same for meets).
See https://en.wikipedia.org/wiki/Crossing_number_(graph_theory) for details
I.e. implement a function for computing whether 2 edge coloured digraphs are isomorphic or not. The relevant functionality is already in the kernel module, this is just about adding some...
A probabilistic, parallel graph automorphism and isomorphism solver: https://www.mathematik.tu-darmstadt.de/didaktik/ag_forschung/gg_forschung/engages/dejavu.en.jsp
It'd be good to create issues to implement all the features on: https://doc.sagemath.org/html/en/reference/graphs/sage/graphs/digraph.html that we do not have already.
This issue is a feature request to implement a number of "named" graphs from the literature: - [x] [FolkmanGraph](https://en.wikipedia.org/wiki/Folkman_graph) (FB + MT + RC + SH) #386 - [x] [Goldner–Harary...
In Semigroups v4.0.0, we started using autodoc to produce the documentation, this has a number of advantages, and can be used with the current documentation sources (i.e. doesn't require to...
This PR fixes some bugs introduced in #459