A note on signed k-submatching in graphs

zbMATH Open1333.05233arXiv1411.0132MaRDI QIDQ2800786FDOQ2800786

Authors: S. Akbari, M. Dalirrooyfard, K. Ehsani, R. Sherkati 

Publication date: 18 April 2016

Published in: The Australasian Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1411.0132

Recommendations

• The signed \(k\)-submatchings in graphs
• Signed \((b,k)\)-matchings in graphs
• The signed matchings in graphs
• On the signed matchings of graphs
• scientific article; zbMATH DE number 7132819

zbMATH Keywords

matching numbersigned \(k\)-matching number

Mathematics Subject Classification ID

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

Cited In (5)

• On the signed matchings of graphs
• Signed \((b,k)\)-matchings in graphs
• The signed \(k\)-submatchings in graphs
• The signed matchings in graphs
• A matheuristic approach for the maximum balanced subgraph of a signed graph

This page was built for publication: A note on signed \(k\)-submatching in graphs

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