Generalized Matching Preclusion in Bipartite Graphs
From MaRDI portal
Publication:5225539
Recommendations
- A note on generalized matching preclusion in bipartite graphs
- Matching preclusion of the generalized Petersen graph
- Conditional matching preclusion for regular bipartite graphs and their Cartesian product
- Some Results on Matching in Bipartite Graphs
- scientific article; zbMATH DE number 1135678
- A class of `matching-equivalent' bipartite graphs
- scientific article; zbMATH DE number 4033793
- New lower bounds for matching numbers of general and bipartite graphs
- Strong matching preclusion of the generalized Petersen graph
- Conditional matching preclusion for the arrangement graphs
Cited in
(11)- Generalized matching networks and their properties
- Matching preclusion for vertex-transitive networks
- Conditional matching preclusion for regular bipartite graphs and their Cartesian product
- A note on generalized matching preclusion in bipartite graphs
- Matching preclusion for n-grid graphs
- The (conditional) matching preclusion for burnt pancake graphs
- Excluded $t$-Factors in Bipartite Graphs: Unified Framework for Nonbipartite Matchings, Restricted 2-Matchings, and Matroids
- Integer \(k\)-matching preclusion of graphs
- Matching preclusion and conditional matching preclusion for bipartite interconnection networks. I: Sufficient conditions
- Matching preclusion for the (n, k)-bubble-sort graphs
- scientific article; zbMATH DE number 5919743 (Why is no real title available?)
This page was built for publication: Generalized Matching Preclusion in Bipartite Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5225539)