Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by Crossref.
Harary, Frank
and
Prins, Geert
1959.
The number of homeomorphically irreducible trees, and other species.
Acta Mathematica,
Vol. 101,
Issue. 1-2,
p.
141.
Read, R. C.
1960.
The Number of k-Coloured Graphs on Labelled Nodes.
Canadian Journal of Mathematics,
Vol. 12,
Issue. ,
p.
410.
Austin, T. L.
1960.
The Enumeration of Point Labelled Chromatic Graphs and Trees.
Canadian Journal of Mathematics,
Vol. 12,
Issue. ,
p.
535.
Riordan, John
1968.
Forests of labeled trees.
Journal of Combinatorial Theory,
Vol. 5,
Issue. 1,
p.
90.
Moon, J.W.
1969.
Connected graphs with unlabeled end-points.
Journal of Combinatorial Theory,
Vol. 6,
Issue. 1,
p.
65.
Read, Ronald C.
1970.
Some Unusual Enumeration Problems.
Annals of the New York Academy of Sciences,
Vol. 175,
Issue. 1,
p.
314.
Liskovets, V. A.
1970.
The number of strongly connected directed graphs.
Mathematical Notes of the Academy of Sciences of the USSR,
Vol. 8,
Issue. 6,
p.
877.
Wright, E. M.
1970.
XIX.—Asymptotic enumeration of connected graphs.
Proceedings of the Royal Society of Edinburgh. Section A. Mathematical and Physical Sciences,
Vol. 68,
Issue. 4,
p.
298.
Read, Ronald C.
1970.
Some Unusual Enumeration Problems.
Annals of the New York Academy of Sciences,
Vol. 175,
Issue. 1 The Impac of,
p.
314.
Cadogan, C.C
1971.
The Möbius function and connected graphs.
Journal of Combinatorial Theory, Series B,
Vol. 11,
Issue. 3,
p.
193.
GALLOPÍN, GILBERTO C.
1972.
Systems Analysis and Simulation in Ecology.
p.
241.
Wright, E. M.
1973.
The probability of connectedness of a large unlabelled graph.
Bulletin of the American Mathematical Society,
Vol. 79,
Issue. 4,
p.
767.
1973.
Graphical Enumeration.
p.
253.
HARARY, FRANK
and
PALMER, EDGAR M.
1973.
A Survey of Combinatorial Theory.
p.
259.
Ling, Robert F
1975.
An exact probability distribution on the connectivity of random graphs.
Journal of Mathematical Psychology,
Vol. 12,
Issue. 1,
p.
90.
Pless, Vera
and
Sloane, N.J.A
1975.
On the classification and enumeration of self-dual codes.
Journal of Combinatorial Theory, Series A,
Vol. 18,
Issue. 3,
p.
313.
Jackson, D.M
and
Reilly, J.W
1975.
The enumeration of homeomorphically irreducible labelled graphs.
Journal of Combinatorial Theory, Series B,
Vol. 19,
Issue. 3,
p.
272.
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.
Wright, Edward
1977.
A note of welcome.
Journal of Graph Theory,
Vol. 1,
Issue. 1,
p.
11.
Brent, R. P.
and
Kung, H. T.
1978.
Fast Algorithms for Manipulating Formal Power Series.
Journal of the ACM,
Vol. 25,
Issue. 4,
p.
581.