Complexity results for rainbow matchings

From MaRDI portal
Revision as of 10:23, 3 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:2637345

DOI10.1016/J.TCS.2013.12.013zbMath1282.68195arXiv1312.7253OpenAlexW2034652539MaRDI QIDQ2637345

Van Bang Le, Florian Pfender

Publication date: 11 February 2014

Published in: Theoretical Computer Science (Search for Journal in Brave)

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




Related Items (9)




Cites Work




This page was built for publication: Complexity results for rainbow matchings