Two problems in the enumeration of unlabelled graphs.
Edward M. Wright: Two problems in the enumeration of unlabelled graphs. Discret. Math. 9(3): 289-292 (1974)
View ArticleThe number of connected sparsely edged graphs.
Edward M. Wright: The number of connected sparsely edged graphs. J. Graph Theory 1(4): 317-330 (1977)
View ArticleThe number of connected sparsely edged graphs. II. Smooth graphs and blocks.
Edward M. Wright: The number of connected sparsely edged graphs. II. Smooth graphs and blocks. J. Graph Theory 2(4): 299-305 (1978)
View ArticleAsymptotic formulas for the number of oriented graphs.
Edward M. Wright: Asymptotic formulas for the number of oriented graphs. J. Comb. Theory, Ser. B 24(3): 370-373 (1978)
View ArticleThe exponential generating function of labelled blocks.
Nick Wormald, Edward M. Wright: The exponential generating function of labelled blocks. Discret. Math. 25(1): 93-96 (1979)
View ArticleThe number of connected sparsely edged graphs. III. Asymptotic results.
Edward M. Wright: The number of connected sparsely edged graphs. III. Asymptotic results. J. Graph Theory 4(4): 393-407 (1980)
View ArticleBurnside's lemma: A historical note.
Edward M. Wright: Burnside's lemma: A historical note. J. Comb. Theory, Ser. B 30(1): 89-90 (1981)
View ArticleThe number of connected sparsely edged graphs. IV large nonseparable graphs.
Edward M. Wright: The number of connected sparsely edged graphs. IV large nonseparable graphs. J. Graph Theory 7(2): 219-229 (1983)
View ArticleReflection of Localized Beams from a Nonlinear Absorbing Interface.
James A. Powell, Edward M. Wright, J. V. Moloney: Reflection of Localized Beams from a Nonlinear Absorbing Interface. SIAM J. Appl. Math. 54(3): 774-788 (1994)
View ArticleAn introduction to the theory of numbers (5. ed.).
Godfrey H. Hardy, Edward M. Wright: An introduction to the theory of numbers (5. ed.). Clarendon Press 1995, ISBN 978-0-19-853171-5, pp. I-XIV, 1-426
View Article
More Pages to Explore .....