- Published 1989 in Discrete Mathematics
DOI:10.1016/0012-365X(89)90149-0

Covering graphs of various types of finite partially ordered sets have been extensively studied since Ore in [2] asked for a characterization of such graphs in general. In this note we introduce a graph, called the m-chain graph of a poset, that reduces to the covering graph when m = 1. Since we will show how to construct the m-chain graph for m > 2 as the… (More)

### Presentations referencing similar topics