On the signed matchings of graphs

DOI10.22190/FUMI2002541JMaRDI QIDQ5010153zbMATH OpenFDO

Authors Samane Javan, H. R. Maimani

Publication date 24 August 2021

Published in Facta Universitatis, Series: Mathematics and Informatics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.22190/FUMI2002541J

zbMATH Keywords

bipartite graphssigned matchingsigned matching number

Mathematics Subject Classification ID

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

Recommendations

• The signed matchings in graphs
• The signed \(k\)-submatchings in graphs
• Signed (b,k)-matchings in graphs
• A note on signed k-submatching in graphs
• scientific article; zbMATH DE number 6464010

Cites work

• A polynomial algorithm for b-matchings: An alternative approach
• scientific article; zbMATH DE number 6506585 (Why is no real title available?)
• scientific article; zbMATH DE number 6464010 (Why is no real title available?)
• The signed \(k\)-submatchings in graphs
• The signed matchings in graphs

Cited in

(10)

• The signed \(k\)-submatchings in graphs
• A note on signed k-submatching in graphs
• Canonical-sign-compatibility of some signed graphs
• Subdivision of edges and matching size.
• Signed (b,k)-matchings in graphs
• The signed matchings in graphs
• Displaying blocking pairs in signed graphs
• On the basis pair graphs of signed-graphic matroids
• scientific article; zbMATH DE number 6464010 (Why is no real title available?)
• scientific article; zbMATH DE number 6180654 (Why is no real title available?)

This page was built for publication: On the signed matchings of graphs

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