Digraphs

Digraphs copied to clipboard

Vertex Colour Respecting canonical labelling

1

Hi, The current `CanonicalLabelling` in Digraphs does support coloured vertices, but doesn't "respect" the colours (that is, it doesn't only permute colours inside their colour class). This means, unlike finding...

ChrisJefferson

Come up with a new bit of BibTeX for the "How to cite Digraphs" part of the Digraphs homepage

2

This is how it currently is: ``` @misc{DeBeule2025aa, Author = { Jan De Beule and Julius Jonu{\v s}as and James D. Mitchell and Michael Torpey and Maria Tsalakou and Wilf...

wilfwilson

In theory this ought to be quite simple to do, I'm not sure how difficult it would be in practice though. I'm thinking of wanting to be able to compute...

james-d-mitchell

Add new variant/sibling of `DigraphByEdges` that can accept edges defined in terms of labelled vertices

1

@RussWoodroofe, at GAP Days Summer 2025 in Koper, was wanting to create the Petersen digraph, in the way that was most intuitive to him. You can think of the Petersen...

wilfwilson

When pickling a vertex or edge labelled digraph, also pickle the vertex labels and/or edge labels

1

This is not currently done which is a shame!

james-d-mitchell

At present it's possible to do things like `DotEdgeColoredDigraph` where the second argument is the list of colours. I often find this second argument more or less difficult to propagate,...

james-d-mitchell

Now we have lifted the number of nodes permitted in the clique and homomorphism finding from 512 to any value, we should issue an info warning when we try to...

james-d-mitchell

Something like the following, where `D` is digraph, `src` is the start node of the path, and `path` is a list of edge indices. ~~~ FollowPath := function(D, src, path)...

james-d-mitchell

which > returns a list consisting of pairwise non-isomorphic elements

james-d-mitchell