All Questions

For a given weighted graph $G = (V, E)$, there is a simple algorithm for finding the minimum weight circuit by running Dijkstra's algorithm $|E|$ times. Also for a matroid $M = (E, I)$ one can use the ...

For a graph, we can canonical labelings with Nauty or other methods. But for a matroid, I do not find an easy way to labeling. Dillon Mayhewa, Gordon F. Royle introduced the hyperplane graph of a ...

I am looking for information about graphs, that are the union of $k$ edge-disjoint spanning trees "EDSP" of finite symmetric graphs. I am especially interested in theorems and algorithms related to ...