Bisimplicial edges in bipartite graphs

DOI10.1016/J.DAM.2011.03.004MaRDI QIDQ2446296zbMATH OpenOpenAlexFDO

Authors Matthijs Bomhoff, Bodo Manthey

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

bipartite graphsGaussian eliminationrandom graphs

Mathematics Subject Classification ID

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

Recommendations

• Bipartite bithreshold graphs
• Bisimplicial vertices in even-hole-free graphs
• scientific article; zbMATH DE number 4061296
• scientific article; zbMATH DE number 4106890
• Binomial edge ideals of bipartite graphs
• Bipartite Graphs and their Degree Sets
• scientific article; zbMATH DE number 2061146
• Bipartable graphs
• scientific article; zbMATH DE number 1355279
• Generalization of bipartite graphs

Cites work

• scientific article; zbMATH DE number 819814 (Why is no real title available?)
• Matching is as easy as matrix inversion
• Matrix multiplication via arithmetic progressions
• Perfect Elimination and Chordal Bipartite Graphs
• Recognition of perfect elimination bipartite graphs
• Recognizing quasi-triangulated graphs.

Cited in

(4)

• A probabilistic estimator for the vertex deletion problem
• Recognizing sparse perfect elimination bipartite graphs
• Edge rings of bipartite graphs with linear resolutions
• Bisimplicial vertices in even-hole-free graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2446296)