Morten Hegner Nielsen

Steiner Trees and Convex Geometries

Let

Finding complementary cycles in locally semicomplete digraphs

V

Cycles in k-traceable oriented graphs

be a finite set and

Separation properties of 3-Steiner and 3-monophonic convexity in graphs

\mathcal{M}

Factors with Multiple Degree Constraints in Graphs

a collection of subsets of

System and method supporting configurable object definitions

V

Longest path partitions in generalizations of tournaments

. Then

Connecting entities with general functionality in aspect patterns

\mathcal{M}

A Traceability Conjecture for Oriented Graphs

is an alignment of

Traceability of k-traceable oriented graphs

V