Indifference Digraphs: A Generalization of Indifference Graphs and Semiorders
From MaRDI portal
(Redirected from Publication:4296509)
Recommendations
Cited in
(19)- Recognizing interval digraphs and interval bigraphs in polynomial time
- Short proofs for interval digraphs
- Interval \(k\)-graphs and orders
- Representing digraphs using intervals or circular arcs
- 2-nested matrices: towards understanding the structure of circle graphs
- Stick graphs with length constraints
- A characterization of 2-tree proper interval 3-graphs
- Graphs and digraphs represented by intervals and circular arcs
- Optimal greedy algorithms for indifference graphs
- Permutation bigraphs and interval containments
- Boolean rank of upset tournament matrices
- Intersection representation of digraphs in trees with few leaves
- A novel framework for detecting maximally banded matrices in binary data
- Circularly compatible ones, D-circularity, and proper circular-arc bigraphs
- Circular-arc bigraphs and its subclasses
- Linear-time recognition of double-threshold graphs
- A characterization of unit interval bigraphs of open and closed intervals
- Gridline indifference graphs
- New characterizations of proper interval bigraphs
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)
