Representing digraphs using intervals or circular arcs
From MaRDI portal
Publication:1910520
DOI10.1016/0012-365X(94)00167-HzbMath0838.05056MaRDI QIDQ1910520
Douglas B. West, B. K. Sanyal, Malay Kr. Sen
Publication date: 24 March 1996
Published in: Discrete Mathematics (Search for Journal in Brave)
posetdigraphsinterval graphadjacency matricesFerrers dimensioncircular-arc intersection digraphscomparability digraphinterval containment digraphsoverlap representationsunit interval digraphs
Related Items (13)
Ferrers dimension of grid intersection graphs ⋮ Circular‐Arc Bigraphs and Its Subclasses ⋮ Adjacency matrices of probe interval graphs ⋮ Recognition and characterization of chronological interval digraphs ⋮ Permutation bigraphs and interval containments ⋮ Bipartite Analogues of Comparability and Cocomparability Graphs ⋮ Bigraphs/digraphs of Ferrers dimension 2 and asteroidal triple of edges ⋮ Chronological orderings of interval digraphs ⋮ Representation characterizations of chordal bipartite graphs ⋮ Characterizations and recognition of circular-arc graphs and subclasses: a survey ⋮ Miscellaneous Digraph Classes ⋮ Homogeneously Representable Interval Bigraphs ⋮ Graphs and digraphs represented by intervals and circular arcs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On realizable biorders and the biorder dimension of a relation
- Interval graphs and related topics
- Ferrers digraphs and threshold graphs
- The interval inclusion number of a partially ordered set
- Algorithms for interval catch digraphs
- Matrix characterizations of circular-arc graphs
- Interval digraphs: An analogue of interval graphs
- Containment Graphs, Posets, and Related Classes of Graphs
- Circular‐arc digraphs: A characterization
- Indifference Digraphs: A Generalization of Indifference Graphs and Semiorders
- Partially Ordered Sets
This page was built for publication: Representing digraphs using intervals or circular arcs
