Edge-Colored Graph Theory is a vibrant area within combinatorics that extends the classical study of graphs by assigning colours to edges. This paradigm not only uncovers subtle structural properties ...

Let G = (V(G), E(G)) be a graph. A set S ⊆ E(G) is an edge k-cut in G if the graph G − S = (V(G), E(G) \ S) has at least k connected components. The generalized k-edge connectivity of a graph G, ...

SIAM Journal on Applied Mathematics, Vol. 66, No. 4 (Mar. - May, 2006), pp. 1321-1338 (18 pages) For mass action kinetics, the capacity for multiple equilibria in an isothermal homogeneous continuous ...

On the 19th of February 2025, M.Sc. Andreas Grigorjew defends his PhD thesis on Algorithms and Graph Structures for Splitting Network Flows, in Theory and Practice. The thesis is related to research ...