Classes of interval digraphs and 0, 1-matrices. (English) Zbl 0955.05051
Summary: We consider a hierarchy of four classes of interval digraphs, or equivalently four classes of 0, 1-matrices. We provide forbidden submatrix characterizations separating the successive classes. The largest class is the set of (adjacency matrices of) interval digraphs; the smallest is the set of (adjacency matrices of) unit interval digraphs.
MSC:
05C20 | Directed graphs (digraphs), tournaments |
05C50 | Graphs and linear algebra (matrices, eigenvalues, etc.) |
05C75 | Structural characterization of families of graphs |