Several results on chordal bipartite graphs
From MaRDI portal
Publication:4210004
DOI10.1023/A:1022806215452zbMATH Open0898.05043MaRDI QIDQ4210004FDOQ4210004
Publication date: 28 September 1998
Published in: Czechoslovak Mathematical Journal (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/30384
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Computational methods for sparse matrices (65F50) Paths and cycles (05C38)
Cites Work
- Triangulated graphs and the elimination process
- Perfect Elimination and Chordal Bipartite Graphs
- Algorithmic Aspects of Vertex Elimination on Directed Graphs
- Completion of partial matrices to contractions
- Inheritance principles for chordal graphs
- Completion of operator partial matrices associated with chordal graphs
Cited In (14)
- The cyclic rank completion problem with general blocks
- Minimal split completions
- On the complexity of finding chordless paths in bipartite graphs and some interval operators in graphs and hypergraphs
- A min-max property of chordal bipartite graphs with applications
- Skew rank decompositions
- Triangular ranks do not bound minimum ranks in matrix completion
- Strongly Chordal and Chordal Bipartite Graphs Are Sandwich Monotone
- Title not available (Why is that?)
- A generalization of Eagon–Reiner’s theorem and a characterization of bi-CMt bipartite and chordal graphs
- Title not available (Why is that?)
- Strongly chordal and chordal bipartite graphs are sandwich monotone
- On the bi-enhancement of chordal-bipartite probe graphs
- Single-edge monotonic sequences of graphs and linear-time algorithms for minimal completions and deletions
- Title not available (Why is that?)
Recommendations
This page was built for publication: Several results on chordal bipartite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4210004)
