Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Grimmett, G. R.
1975.
A non-Markovian birth process with logarithmic growth.
Journal of Applied Probability,
Vol. 12,
Issue. 4,
p.
673.
Grimmett, G. R.
1975.
A non-Markovian birth process with logarithmic growth.
Journal of Applied Probability,
Vol. 12,
Issue. 04,
p.
673.
Bollobas, B.
and
Erdös, P.
1976.
Cliques in random graphs.
Mathematical Proceedings of the Cambridge Philosophical Society,
Vol. 80,
Issue. 3,
p.
419.
Kučera, L.
1977.
Fundamentals of Computation Theory.
Vol. 56,
Issue. ,
p.
447.
Grimmett, Geoffrey
1977.
Transactions of the Seventh Prague Conference on Information Theory, Statistical Decision Functions, Random Processes and of the 1974 European Meeting of Statisticians.
p.
203.
Chvátal, V.
1977.
Determining the Stability Number of a Graph.
SIAM Journal on Computing,
Vol. 6,
Issue. 4,
p.
643.
Kučera, L.
1977.
Fundamentals of Computation Theory.
Vol. 56,
Issue. ,
p.
447.
Valiant, L. G.
1978.
GI — 8. Jahrestagung.
Vol. 16,
Issue. ,
p.
326.
Karp, Richard M.
1979.
Automata, Languages and Programming.
Vol. 71,
Issue. ,
p.
338.
McDiarmid, Colin
1979.
Determining the Chromatic Number of a Graph.
SIAM Journal on Computing,
Vol. 8,
Issue. 1,
p.
1.
Pulleyblank, W. R.
1979.
Minimum node covers and 2-bicritical graphs.
Mathematical Programming,
Vol. 17,
Issue. 1,
p.
91.
Klee, Victor
1979.
Information Linkage Between Applied Mathematics and Industry.
p.
71.
Schürger, K.
1979.
Limit theorems for complete subgraphs of random graphs.
Periodica Mathematica Hungarica,
Vol. 10,
Issue. 1,
p.
47.
Hubert, Lawrence J.
and
Baker, Frank B.
1979.
Identifying a Migration Effect in Complete-Link Hierarchical Clustering.
Journal of Educational Statistics,
Vol. 4,
Issue. 1,
p.
74.
Hammer, Gerald
1980.
Quantitative Wirtschafts- und Unternehmensforschung.
p.
398.
Weide, Bruce W.
1980.
Random Graphs and Graph Optimization Problems.
SIAM Journal on Computing,
Vol. 9,
Issue. 3,
p.
552.
Lueker, George S.
1981.
Optimization Problems on Graphs with Independent Random Edge Weights.
SIAM Journal on Computing,
Vol. 10,
Issue. 2,
p.
338.
Bollobás, Béla
1981.
Degree sequences of random graphs.
Discrete Mathematics,
Vol. 33,
Issue. 1,
p.
1.
Lueker, George S.
1981.
Computer Science and Statistics: Proceedings of the 13th Symposium on the Interface.
p.
68.
Bollobás, Béla
1981.
The diameter of random graphs.
Transactions of the American Mathematical Society,
Vol. 267,
Issue. 1,
p.
41.