Indifference Digraphs: A Generalization of Indifference Graphs and Semiorders
From MaRDI portal
Publication:4296509
DOI10.1137/S0895480190177145zbMATH Open0798.05025MaRDI QIDQ4296509FDOQ4296509
Authors:
Publication date: 19 June 1994
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Recommendations
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Directed graphs (digraphs), tournaments (05C20) Structural characterization of families of graphs (05C75) Ordered structures (06F99)
Cited In (19)
- Graphs and digraphs represented by intervals and circular arcs
- Boolean rank of upset tournament matrices
- Intersection representation of digraphs in trees with few leaves
- Linear-time recognition of double-threshold graphs
- Recognizing interval digraphs and interval bigraphs in polynomial time
- Short proofs for interval digraphs
- Gridline indifference graphs
- Stick graphs with length constraints
- A characterization of unit interval bigraphs of open and closed intervals
- 2-nested matrices: towards understanding the structure of circle graphs
- Circularly Compatible Ones, $D$-Circularity, and Proper Circular-Arc Bigraphs
- Optimal greedy algorithms for indifference graphs
- New characterizations of proper interval bigraphs
- Permutation bigraphs and interval containments
- A characterization of 2-tree proper interval 3-graphs
- A novel framework for detecting maximally banded matrices in binary data
- Circular‐Arc Bigraphs and Its Subclasses
- Interval \(k\)-graphs and orders
- Representing digraphs using intervals or circular arcs
This page was built for publication: Indifference Digraphs: A Generalization of Indifference Graphs and Semiorders
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4296509)
