Bisimplicial edges in bipartite graphs
type: Item
instance of: scholarly article
title: Bisimplicial edges in bipartite graphs
zbMATH Open document ID: 1287.05138
author: Matthijs Bomhoff
author: Bodo Manthey
published in: Discrete Applied Mathematics
publication date: 2014-04-16T00:00:00Z
Mathematics Subject Classification ID: 05C80
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 05C70
zbMATH DE Number: 6286013
zbMATH Keywords: bipartite graphs
zbMATH Keywords: random graphs
zbMATH Keywords: Gaussian elimination
MaRDI profile type: Publication
full work available at URL: j.dam.2011.03.004
OpenAlex ID: W2156772834
cites work: Matrix multiplication via arithmetic progressions
cites work: Recognition of perfect elimination bipartite graphs
cites work: Perfect Elimination and Chordal Bipartite Graphs
cites work: Q4856179
cites work: Matching is as easy as matrix inversion
cites work: Recognizing quasi-triangulated graphs.
DOI: 10.1016/J.DAM.2011.03.004
Recommended article: Bipartite bithreshold graphs
Recommended article: Bisimplicial vertices in even-hole-free graphs
Recommended article: Q3795708
Recommended article: Q3831040
Recommended article: Binomial edge ideals of bipartite graphs
Recommended article: Bipartite Graphs and their Degree Sets
Recommended article: Q4456998
Recommended article: Bipartable graphs
Recommended article: Q4269434
Recommended article: Generalization of bipartite graphs
description: scientific article