David Coudert
David Coudert
Currently, method `chromatic_polynomial` raises an error for immutable graphs with multiple edges. ```sage sage: G = Graph([(0, 1), (0, 1)], multiedges=True, immutable=True) sage: G.chromatic_polynomial() --------------------------------------------------------------------------- ValueError Traceback (most recent call...
use decomposition into bi/tri-connected components and atoms for iterating over minimal separators
In #39341, we added an iterator over the minimal separators of a graph. Here we use decompositions into bi and tri connected components: - We first decompose the graph into...
Following discussions in #39177, we add the option to return immutable graphs to some generators in `src/sage/graphs/generators/ditance_regular.pyx`. ### :memo: Checklist - [x] The title is concise and informative. - [x]...