Enumerating k-connected orientations

Abstract

[en] This thesis aims to study an enumeration algorithm for the k-connected orientations of a given graph, both from the theoretic perspective as well as in terms of implementation. The latter had not been done before. The process has been divided into two parts. Firstly, generating a first k-connected orientation from a 2k-connected multi-graph, and secondly using the enumeration algorithms presented by Blind, Knauer and Valicov. Finally, for the computational part, a SageMath library with the implementation is presented, to generate the entire set of k-connected orientations, with a planned SageMath core contribution.