(EN) The German partners will contribute to the algorithmic side, using their expertise in the use of graph searches in the development of fast graph algorithms, many of which have also relied on linear vertex orderings. The Slovenian side, on the other hand, is specialized in structural graph theory. This includes research on graph classes defined with constraints imposed on cliques and/or independent sets, structural properties of the maximum independent set and domination problems, as well as product graphs and graphs with high degrees of symmetry. The project will be an important step towards a consolidation of the recently established cooperation between mathematicians in Koper and Cottbus.