Bisimplicial edges in bipartite graphs

DOI10.1016/j.dam.2011.03.004zbMath1287.05138OpenAlexW2156772834MaRDI QIDQ2446296

Bodo Manthey, Matthijs Bomhoff

Publication date: 16 April 2014

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

Full work available at URL: https://doi.org/10.1016/j.dam.2011.03.004

zbMATH Keywords

random graphsGaussian eliminationbipartite graphs

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Unnamed Item
• Matrix multiplication via arithmetic progressions
• Matching is as easy as matrix inversion
• Recognizing quasi-triangulated graphs.
• Recognition of perfect elimination bipartite graphs
• Perfect Elimination and Chordal Bipartite Graphs

This page was built for publication: Bisimplicial edges in bipartite graphs