Kenneth A. Berman. Matchings and spanning trees in Boolean weighted graphs. Journal of Combinatorial Theory, Series A, 30(3):343-350, 1981. [doi]
@article{Berman81a,
title = {Matchings and spanning trees in Boolean weighted graphs},
author = {Kenneth A. Berman},
year = {1981},
doi = {10.1016/0095-8956(81)90051-4},
url = {http://dx.doi.org/10.1016/0095-8956(81)90051-4},
tags = {graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/Berman81a},
cites = {0},
citedby = {0},
journal = {Journal of Combinatorial Theory, Series A},
volume = {30},
number = {3},
pages = {343-350},
}