On a class of posets and the corresponding comparability graphs

Abstract The concept of an order-theoretical tree is generalized to the notion of a multitree. The comparability graphs of multitrees are characterized and studied with respect to minimal path coverings.