Biclique comparability digraphs of bipartite graphs and minimum ranks of partial matrices
From MaRDI portal
Recommendations
Cites work
- Chordal bipartite graphs and crowns
- Computing a perfect edge without vertex elimination ordering of a chordal bipartite graph
- Graph Classes: A Survey
- scientific article; zbMATH DE number 4107004 (Why is no real title available?)
- Minimum rank completions
- The lower order of lower triangular operators and minimal rank extensions
- Topics in Intersection Graph Theory
- Weakly Triangulated Comparability Graphs
Cited in
(6)- Symmetric completions of cycles and bipartite graphs
- scientific article; zbMATH DE number 1439493 (Why is no real title available?)
- Bipartite Analogues of Comparability and Cocomparability Graphs
- Rank decomposition under combinatorial constraints
- Incomplete pairwise comparison matrices based on graphs with average degree approximately 3
- Triangular ranks do not bound minimum ranks in matrix completion
This page was built for publication: Biclique comparability digraphs of bipartite graphs and minimum ranks of partial matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1886361)