Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
Márton Makai. On Maximum Cost K::{t, t}::-Free t-Matchings of Bipartite Graphs. SIAM J. Discrete Math., 21(2):349-360, 2007. [doi]
No references recorded for this publication.
No citations of this publication recorded.