Matching orderable and separable hypergraphs
Crossref DOI link: https://doi.org/10.1007/s11590-022-01854-0
Published Online: 2022-02-02
Published Print: 2022-06
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Onn, Shmuel https://orcid.org/0000-0002-4526-5534
Funding for this research was provided by:
israel science foundation (308/18)
Text and Data Mining valid from 2022-02-02
Version of Record valid from 2022-02-02
Article History
Received: 11 July 2021
Accepted: 15 January 2022
First Online: 2 February 2022