The recognition of indifference digraphs and generalized semiorders
From MaRDI portal
Publication:4865532
DOI<235::AID-JGT14>3.0.CO;2-I 10.1002/(SICI)1097-0118(199602)21:2<235::AID-JGT14>3.0.CO;2-IzbMath0839.05046OpenAlexW2026445978MaRDI QIDQ4865532
Publication date: 25 February 1996
Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199602)21:2<235::aid-jgt14>3.0.co;2-i
Combinatorics of partially ordered sets (06A07) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20)
Related Items (7)
Recognizing interval digraphs and interval bigraphs in polynomial time ⋮ Short proofs for interval digraphs ⋮ Permutation bigraphs and interval containments ⋮ Forbidden substructure for interval digraphs/bigraphs ⋮ Bigraphs/digraphs of Ferrers dimension 2 and asteroidal triple of edges ⋮ Circularly Compatible Ones, $D$-Circularity, and Proper Circular-Arc Bigraphs ⋮ Graphs and digraphs represented by intervals and circular arcs
This page was built for publication: The recognition of indifference digraphs and generalized semiorders
