Nordhaus–Gaddum type result for the matching number of a graph
Crossref DOI link: https://doi.org/10.1007/s10878-017-0120-6
Published Online: 2017-03-14
Published Print: 2017-10
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Lin, Huiqiu
Shu, Jinlong
Wu, Baoyindureng
License valid from 2017-03-14