Biclique comparability digraphs of bipartite graphs and minimum ranks of partial matrices

DOI10.1016/j.disc.2004.07.004zbMath1050.05059OpenAlexW1964518699MaRDI QIDQ1886361

Terry A. McKee

Publication date: 18 November 2004

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

Full work available at URL: https://doi.org/10.1016/j.disc.2004.07.004

zbMATH Keywords

Bipartite graphsChordal bipartite graphsDigraphsComparability graphsMinimum ranksPartial matrices

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Directed graphs (digraphs), tournaments (05C20)

Cites Work

• Computing a perfect edge without vertex elimination ordering of a chordal bipartite graph
• Chordal bipartite graphs and crowns
• The lower order of lower triangular operators and minimal rank extensions
• Minimum rank completions
• Topics in Intersection Graph Theory
• Graph Classes: A Survey
• Weakly Triangulated Comparability Graphs
• Unnamed Item

This page was built for publication: Biclique comparability digraphs of bipartite graphs and minimum ranks of partial matrices