An extremity is a vertex such that the removal of its closed neighbourhood does not increase
the number of connected components. Let $ Ext_ {\alpha} $ be the class of all connected …

In this thesis we describe dualities in directed as well as undirected graphs based on tools
such as width-parameters, obstructions and substructures. We mainly focus on directed …

A moplex is a natural graph structure that arises when lifting Dirac's classical theorem from
chordal graphs to general graphs. The notion is known to be closely related to lexicographic …