Short proofs for interval digraphs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3815694 (Why is no real title available?)
- scientific article; zbMATH DE number 861315 (Why is no real title available?)
- scientific article; zbMATH DE number 3307330 (Why is no real title available?)
- scientific article; zbMATH DE number 3064989 (Why is no real title available?)
- Characterizing circular-arc graphs
- Circular‐arc digraphs: A characterization
- Composite measurement
- Connection digraphs and second-order line digraphs
- Indifference Digraphs: A Generalization of Indifference Graphs and Semiorders
- Interval digraphs: An analogue of interval graphs
- Matrix characterizations of circular-arc graphs
- The recognition of indifference digraphs and generalized semiorders
Cited in
(14)- scientific article; zbMATH DE number 4168705 (Why is no real title available?)
- A short proof of the degree bound for interval number
- Relationships between the class of unit grid intersection graphs and other classes of bipartite graphs
- Boolean rank of upset tournament matrices
- Chordal digraphs
- An interval digraph in relation to its associated bipartite graph
- Linear-time recognition of double-threshold graphs
- Adjacency matrices of probe interval graphs
- A min-max property of chordal bipartite graphs with applications
- Recognition and characterization of chronological interval digraphs
- Forbidden substructure for interval digraphs/bigraphs
- Permutation bigraphs and interval containments
- Miscellaneous digraph classes
- Circularly compatible ones, \(D\)-circularity, and proper circular-arc bigraphs
This page was built for publication: Short proofs for interval digraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1377823)
