-
The method for recognizing perfect graphs if flawed. Consider the following sage function:
```
def f(n):
c= 0
for g in graphs.nauty_geng(str(n)):
if g.is_perfect():
c+=1…
-
As reported in [this ask question](https://ask.sagemath.org/question/47839), there is a memory leak in `BasisExchangeMatroid.components`, see:
```
sage: G = [g for g in graphs.nauty_geng("12 16:16 …
-
Currently `graphs()` is an iterator that can be used to find an example of the smallest cardinality of a graph with given properties. It is unlogical that the same does not work for directed graphs.…
-
(from #30559)
```
$ grep xz build/pkgs/*/dependencies
build/pkgs/cmake/dependencies:curl zlib bzip2 xz
build/pkgs/gcc/dependencies:| $(MP_LIBRARY) mpfr mpc zlib xz
build/pkgs/gdb/dependencies:mpfr …
-
Playing around with some graphs I noticed that even though the graph below (the McGee graph) not is bipartite, it is claimed to have chromatic number 2 (This should be 3).
The error seems to be in …
-
On `ubuntu-jammy-standard` (https://github.com/sagemath/sage/runs/5962279659)
```
sage -t --random-seed=156404901056981760924144629149815074678 src/sage/tests/cmdline.py
[216 tests, 73.54 s]
--…
-
I am trying to generate an automorphism graphs for a set of 2D particles on a grid.
Where I assign vertex attribute depending on particle type, and edge attributes depending on pairwise particle dist…
-
Hi,
I'm doing some computations based on enumerating graphs via "nauty_geng()", which enumerate all graphs of a given order.
For each graph, among other few things, I test the odd girth of the gene…
-
If, by some accident, one ends up with multiple stamp files for the same package in `local/var/lib/sage/installed`, an error occurs when running `./configure`.
For example, in my case, in the cours…
-
Hello
In the paper you mentioned that you used Nauty to judge the subplan equivalence (§3.2).But I didn't find the code about Nauty when I look at the source code.I would like to know how you do it. …