Short proofs for interval digraphs

DOI10.1016/S0012-365X(97)81840-7zbMath0884.05044MaRDI QIDQ1377823

Douglas B. West

Publication date: 8 March 1998

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

zbMATH Keywords

adjacency matrixintersection digraphinterval 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)

Related Items

Adjacency matrices of probe interval graphs ⋮ Chordal digraphs ⋮ Recognition and characterization of chronological interval digraphs ⋮ Permutation bigraphs and interval containments ⋮ Forbidden substructure for interval digraphs/bigraphs ⋮ Boolean rank of upset tournament matrices ⋮ A min-max property of chordal bipartite graphs with applications ⋮ Relationships between the class of unit grid intersection graphs and other classes of bipartite graphs ⋮ Circularly Compatible Ones, $D$-Circularity, and Proper Circular-Arc Bigraphs ⋮ Miscellaneous Digraph Classes ⋮ Linear-time recognition of double-threshold graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Connection digraphs and second-order line digraphs
• Composite measurement
• Matrix characterizations of circular-arc graphs
• Interval digraphs: An analogue of interval graphs
• Circular‐arc digraphs: A characterization
• Indifference Digraphs: A Generalization of Indifference Graphs and Semiorders
• The recognition of indifference digraphs and generalized semiorders
• Characterizing circular-arc graphs