Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Tutte, W. T.
1967.
Antisymmetrical Digraphs.
Canadian Journal of Mathematics,
Vol. 19,
Issue. ,
p.
1101.
Hakimi, S.L
and
Frank, H
1969.
Maximum internally stable sets of a graph.
Journal of Mathematical Analysis and Applications,
Vol. 25,
Issue. 2,
p.
296.
Montanari, Ugo
1970.
Heuristically guided search and chromosome matching.
Artificial Intelligence,
Vol. 1,
Issue. 3-4,
p.
227.
Turner, James
and
Kautz, William H.
1970.
A Survey of Progress in Graph Theory in the Soviet Union.
SIAM Review,
Vol. 12,
Issue. S1,
p.
1.
Edmonds, Jack
and
Fulkerson, D.R.
1970.
Bottleneck extrema.
Journal of Combinatorial Theory,
Vol. 8,
Issue. 3,
p.
299.
Brualdi, R. A.
1971.
Matchings in Arbitrary Graphs.
Mathematical Proceedings of the Cambridge Philosophical Society,
Vol. 69,
Issue. 3,
p.
401.
1971.
An account of some aspects of combinatorial mathematics.
Vol. 75,
Issue. ,
p.
236.
Fulkerson, D. R.
1971.
Blocking and anti-blocking pairs of polyhedra.
Mathematical Programming,
Vol. 1,
Issue. 1,
p.
168.
White, Lee J.
1971.
Minimum Covers of Fixed Cardinality in Weighted Graphs.
SIAM Journal on Applied Mathematics,
Vol. 21,
Issue. 1,
p.
104.
Fujii, M.
Kasami, T.
and
Ninomiya, K.
1971.
Erratum “Optimal Sequencing of Two Equivalent Processors”.
SIAM Journal on Applied Mathematics,
Vol. 20,
Issue. 1,
p.
141.
Hopcroft, John E.
and
Karp, Richard M.
1971.
A n5/2 algorithm for maximum matchings in bipartite.
p.
122.
Edmonds, Jack
and
Karp, Richard M.
1972.
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems.
Journal of the ACM,
Vol. 19,
Issue. 2,
p.
248.
Lovász, L.
1972.
On the structure of factorizable graphs. II.
Acta Mathematica Academiae Scientiarum Hungaricae,
Vol. 23,
Issue. 3-4,
p.
465.
Dörfler, W.
and
Mühlbacher, J.
1972.
Bestimmung eines maximalen Matching in beliebigen Graphen.
Computing,
Vol. 9,
Issue. 3,
p.
251.
Lovász, L.
1972.
On the structure of factorizable graphs.
Acta Mathematica Academiae Scientiarum Hungaricae,
Vol. 23,
Issue. 1-2,
p.
179.
Balinski, M.L
1972.
Establishing the matching polytope.
Journal of Combinatorial Theory, Series B,
Vol. 13,
Issue. 1,
p.
1.
Fulkerson, D.R
1972.
Anti-blocking polyhedra.
Journal of Combinatorial Theory, Series B,
Vol. 12,
Issue. 1,
p.
50.
Lawler, Eugene L.
1972.
Periodic Optimization.
p.
37.
Coffman, E. G.
and
Graham, R. L.
1972.
Optimal scheduling for two-processor systems.
Acta Informatica,
Vol. 1,
Issue. 3,
p.
200.
Lovász, L.
1972.
The factorization of graphs. II.
Acta Mathematica Academiae Scientiarum Hungaricae,
Vol. 23,
Issue. 1-2,
p.
223.