Elsevier

Discrete Mathematics

Volume 147, Issues 1–3, 16 December 1995, Pages 235-245
Discrete Mathematics

Representing digraphs using intervals or circular arcs

https://doi.org/10.1016/0012-365X(94)00167-HGet rights and content
Under an Elsevier user license
open archive

Abstract

Containment and overlap representations of digraphs are studied, with the following results. The interval containment digraphs are the digraphs of Ferrers dimension 2, and the circular-arc containment digraphs are the complements of circular-arc intersection digraphs. A poset is an interval containment poset if and only if its comparability digraph is an interval containment digraph, and a graph is an interval graph if and only if the corresponding symmetric digraph with loops is an interval digraph. In an appropriate model of overlap representation using intervals, the unit right-overlap interval digraphs are precisely the unit interval digraphs, and the adjacency matrices of right-overlap interval digraphs have a simple structural characterization bounding their Ferrers dimension by 3.

Cited by (0)

1

Research supported in part by NSA/MSP Grant MDA904-90-H-4011.