A class of `matching-equivalent' bipartite graphs
From MaRDI portal
(Redirected from Publication:1301665)
Recommendations
Cited in
(17)- Mutual placement of bipartite graphs
- On two equimatchable graph classes
- Variations sur le thème \({E+\overline {E} = XY}\) (Variations on the theme \({E+\overline {E} = XY})\)
- Higher matching complexes of complete graphs and complete bipartite graphs
- A note on generalized matching preclusion in bipartite graphs
- Another short proof of the Joni-Rota-Godsil integral formula for counting bipartite matchings
- scientific article; zbMATH DE number 3914366 (Why is no real title available?)
- scientific article; zbMATH DE number 4029616 (Why is no real title available?)
- scientific article; zbMATH DE number 3987 (Why is no real title available?)
- scientific article; zbMATH DE number 7366336 (Why is no real title available?)
- Matchings in complete bipartite graphs and the r-Lah numbers
- Bipartite Analogues of Comparability and Cocomparability Graphs
- Generalized Matching Preclusion in Bipartite Graphs
- The matching equivalent classes of graphs of K₁ I_n
- scientific article; zbMATH DE number 6605082 (Why is no real title available?)
- Matching equivalencies of bipartite graphs
- The new methods for constructing matching-equivalence graphs
This page was built for publication: A class of `matching-equivalent' bipartite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1301665)