Now showing items 1-1 of 1

    • Restricted matchings 

      Fürst, Maximilian (Universität Ulm, 2019-07-05)
      A matching in a graph G is a set of pairwise disjoint edges of G. The matching number of G is defined as the maximum cardinality of a matching in G. In this thesis I will present several results for subgraph-restricted ...