Cubic graphs – those regular graphs in which every vertex has degree three – remain a fertile area of research in both combinatorics and theoretical computer science. These graphs are not only central ...

Graph polynomials serve as robust algebraic encodings of the intricate combinatorial properties inherent to graphs. At the heart of this discipline lies the Tutte polynomial, an invariant that not ...

An interactive programming package called GRAPH, an expert system for graph theory, was developed at the University of Belgrade, Faculty of Electrical Engineering, during the period 1980-1984, GRAPH ...

I'm wrapping up a discrete math course for my university. The last chapter gave us an introduction to graph theory, and I want to learn more. The chapter in question introduced some basic concepts: ...

Abstract. If X is a geodesic metric space and 𝑥₁, 𝑥₂, 𝑥₃ ∈ 𝑋, a geodesic triangle 𝑇 = {𝑥₁, 𝑥₂, 𝑥₃} is the union of the three geodesics [𝑥₁𝑥₂], [𝑥₂𝑥₃] and [𝑥₃𝑥₁] in 𝑋. The space 𝑋 is ...

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 ...