Indifference Digraphs: A Generalization of Indifference Graphs and Semiorders

DOI10.1137/S0895480190177145zbMath0798.05025MaRDI QIDQ4296509

No author found.

Publication date: 19 June 1994

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

semiorderadjacency matricesindifference digraph

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Structural characterization of families of graphs (05C75) Directed graphs (digraphs), tournaments (05C20) Ordered structures (06F99)

Related Items (17)

2-nested matrices: towards understanding the structure of circle graphs ⋮ Representing digraphs using intervals or circular arcs ⋮ Circular‐Arc Bigraphs and Its Subclasses ⋮ Recognizing interval digraphs and interval bigraphs in polynomial time ⋮ Short proofs for interval digraphs ⋮ Permutation bigraphs and interval containments ⋮ New characterizations of proper interval bigraphs ⋮ Boolean rank of upset tournament matrices ⋮ A characterization of unit interval bigraphs of open and closed intervals ⋮ Stick graphs with length constraints ⋮ Intersection representation of digraphs in trees with few leaves ⋮ A characterization of 2-tree proper interval 3-graphs ⋮ Interval \(k\)-graphs and orders ⋮ A novel framework for detecting maximally banded matrices in binary data ⋮ Circularly Compatible Ones, $D$-Circularity, and Proper Circular-Arc Bigraphs ⋮ Linear-time recognition of double-threshold graphs ⋮ Graphs and digraphs represented by intervals and circular arcs

This page was built for publication: Indifference Digraphs: A Generalization of Indifference Graphs and Semiorders