报告题目：Miscellaneous Digraph Classes
There are countless digraph classes, so that any attempt to give a complete overview is doomed to failure. One has to restrict oneself to a selection. We try to survey some of the digraph classes. As tournaments are arguably the best studied class of digraphs with a rich library of strong results, it is no wonder that they and their many generalizations are featured prominently throughout many lecture books. In this regard, we pose no exception. We examine arc-locally semicomplete digraphs,which generalize both semicomplete and semicomplete bipartite digraphs, as well as their generalizations H1-free digraphs and H2-free digraphs. The related classes of H3-free digraphs and H4-free digraphs are also brie y considered. Of course, there are also digraph classes (fairly) unrelated to tournaments such as kernel-perfect digraphs. Furthermore, we consider some digraph classes that appear naturally in applications to other elds such as mathematical logic or computer science. Two such classes with
applications in the construction of interconnection networks are de Bruijn digraphs and Kautz digraphs. Both classes can be dened using the line digraph operator. We also investigate line digraphs and iterated line digraphs in general. Minimal series- parallel digraphs, series-parallel digraphs and series-parallel partial order digraphs appear in ow diagrams and dependency charts and have an application to the problem of scheduling under constraints.