Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Pym, J. S.
1967.
Some results on transversals of families of subsets.
Monatshefte f�r Mathematik,
Vol. 71,
Issue. 5,
p.
446.
Mirsky, L.
1967.
Systems of representatives with repetition.
Mathematical Proceedings of the Cambridge Philosophical Society,
Vol. 63,
Issue. 4,
p.
1135.
Mirsky, L.
1968.
A theorem on common transversals.
Mathematische Annalen,
Vol. 177,
Issue. 1,
p.
49.
Brualdi, Richard A.
and
Scrimger, Edward B.
1968.
Exchange systems, matchings, and transversals.
Journal of Combinatorial Theory,
Vol. 5,
Issue. 3,
p.
244.
Mirsky, L.
1969.
Hall's criterion as a ?self-refining? result.
Monatshefte f�r Mathematik,
Vol. 73,
Issue. 2,
p.
139.
Folkman, Jon
and
Fulkerson, D.R.
1970.
Flows in infinite graphs.
Journal of Combinatorial Theory,
Vol. 8,
Issue. 1,
p.
30.
Brualdi, Richard A.
1970.
Common transversals and strong exchange systems.
Journal of Combinatorial Theory,
Vol. 8,
Issue. 3,
p.
307.
1971.
An account of some aspects of combinatorial mathematics.
Vol. 75,
Issue. ,
p.
236.
Brualdi, Richard A.
1971.
Théorie des Matroïdes.
Vol. 211,
Issue. ,
p.
5.
Aharoni, Ron
1983.
A principle of symmetry in networks.
Discrete Mathematics,
Vol. 44,
Issue. 1,
p.
1.
Parsons, T. D.
1986.
Ancestors, Cardinals, and Representatives.
The American Mathematical Monthly,
Vol. 93,
Issue. 3,
p.
197.
Gupta, Gagan Raj
Sanghavi, Sujay
and
Shroff, Ness
2009.
Is it enough to drain the heaviest bottlenecks?.
p.
483.
Gupta, Gagan R.
Sanghavi, Sujay
and
Shroff, Ness B.
2009.
Node weighted scheduling.
ACM SIGMETRICS Performance Evaluation Review,
Vol. 37,
Issue. 1,
p.
97.
Gupta, Gagan R.
Sanghavi, Sujay
and
Shroff, Ness B.
2009.
Node weighted scheduling.
p.
97.