Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
1971.
An account of some aspects of combinatorial mathematics.
Vol. 75,
Issue. ,
p.
236.
1973.
Graphs and Hypergraphs.
Vol. 6,
Issue. ,
p.
498.
Maurer, Willi
1983.
Bivalent trees and forests or upper bounds for the probability of a union revisited.
Discrete Applied Mathematics,
Vol. 6,
Issue. 2,
p.
157.
Pouzet, M.
1985.
Graphs and Order.
p.
592.
Whitney, Hassler
Birkhoff, Garrett
Mac Lane, Saunders
and
Higgs, D. A.
1986.
A Source Book in Matroid Theory.
p.
15.
Kochol, Martin
1992.
The notion and basic properties of M-transversals.
Discrete Mathematics,
Vol. 104,
Issue. 2,
p.
191.
Yazdi, S. M. Sadegh
and
Savari, Serap A.
2011.
A Max-Flow/Min-Cut Algorithm for Linear Deterministic Relay Networks.
IEEE Transactions on Information Theory,
Vol. 57,
Issue. 5,
p.
3005.
Jensen, Anders
and
Yu, Josephine
2013.
Computing tropical resultants.
Journal of Algebra,
Vol. 387,
Issue. ,
p.
287.
Lucius, Melissa
Falatach, Rebecca
McGlone, Cameron
Makaroff, Katherine
Danielson, Alex
Williams, Cameron
Nix, Jay C.
Konkolewicz, Dominik
Page, Richard C.
and
Berberich, Jason A.
2016.
Investigating the Impact of Polymer Functional Groups on the Stability and Activity of Lysozyme–Polymer Conjugates.
Biomacromolecules,
Vol. 17,
Issue. 3,
p.
1123.
Yu, Josephine
2016.
Do most polynomials generate a prime ideal?.
Journal of Algebra,
Vol. 459,
Issue. ,
p.
468.
Király, Csaba
Szigeti, Zoltán
and
Tanigawa, Shin-ichi
2020.
Packing of arborescences with matroid constraints via matroid intersection.
Mathematical Programming,
Vol. 181,
Issue. 1,
p.
85.