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]
@article{Makai07,
title = {On Maximum Cost K::{t, t}::-Free t-Matchings of Bipartite Graphs},
author = {Márton Makai},
year = {2007},
doi = {10.1137/060652282},
url = {http://dx.doi.org/10.1137/060652282},
tags = {graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/Makai07},
cites = {0},
citedby = {0},
journal = {SIAM J. Discrete Math.},
volume = {21},
number = {2},
pages = {349-360},
}