Search
Now showing items 31-40 of 94
Complexity analysis of P-3-convexity problems on bounded-degree and planar graphs (vol 607, pg 83, 2015)
Wissenschaftlicher Artikel
(Universität Ulm, 2017)
Restricted matchings
Dissertation
(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 ...
A lower bound on the independence number of a graph in terms of degrees and local clique sizes
Beitrag zu einer Konferenz
(Universität Ulm, 2016)
Factor-critical graphs with the minimum number of near-perfect matchings
Wissenschaftlicher Artikel
(Universität Ulm, 2015)
RELATING 2-RAINBOW DOMINATION TO ROMAN DOMINATION
Wissenschaftlicher Artikel
(Universität Ulm, 2017)