Cutsets in bipartite graphs*

DOI10.1080/03081089308818208MaRDI QIDQ4291679zbMATH OpenOpenAlexFDO

Authors Richard A. Brualdi, Bryan L. Shader

Publication date 1993

Published in Linear and Multilinear Algebra (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/03081089308818208

zbMATH Keywords

bipartite graphcutsetsperfect matchingsvector space

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Perfect matchings versus odd cuts
• Special parity of perfect matchings in bipartite graphs
• Matching cutsets in graphs
• On perfect matchings in matching covered graphs

Cites work

• Cyclic and diagonal products on a matrix
• scientific article; zbMATH DE number 3758364 (Why is no real title available?)
• Special parity of perfect matchings in bipartite graphs

Cited in

(11)

• Faces of Birkhoff Polytopes
• Special parity of perfect matchings in bipartite graphs
• Cutsets in perfect and minimal imperfect graphs
• scientific article; zbMATH DE number 4033795 (Why is no real title available?)
• scientific article; zbMATH DE number 1333614 (Why is no real title available?)
• scientific article; zbMATH DE number 2059947 (Why is no real title available?)
• The growth constant of odd cutsets in high dimensions
• scientific article; zbMATH DE number 1905103 (Why is no real title available?)
• scientific article; zbMATH DE number 812089 (Why is no real title available?)
• Hypergraph Cuts with General Splitting Functions
• Matchings in bipartite graphs with a given number of cuts

This page was built for publication: Cutsets in bipartite graphs^*

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