The number of caterpillars. - Frank Harary; Allen J. Schwenk (Discret. Math., 1973)

The distribution of degrees in a large random tree. - Robert W. Robinson; Allen J. Schwenk (Discret. Math., 1975)

On Tactical Configurations with No Four-Cycles. - Frank Harary; Allen J. Schwenk (J. Comb. Theory A, 1976)

An asymptotic evaluation of the cycle index of a symmetric group. - Allen J. Schwenk (Discret. Math., 1977)

Enumeration of graphs with signed points and lines. - Frank Harary; Edgar M. Palmer; Robert W. Robinson; Allen J. Schwenk (J. Graph Theory, 1977)

The number of self-complementary achiral necklaces. - Edgar M. Palmer; Allen J. Schwenk (J. Graph Theory, 1977)

Generalized ramsey theory for graphs VII: Ramsey numbers for multigraphs and networks. - Frank Harary; Allen J. Schwenk (Networks, 1978)

On the number of trees in a random forest. - Edgar M. Palmer; Allen J. Schwenk (J. Comb. Theory B, 1979)

On unimodal sequences of graphical invariants. - Allen J. Schwenk (J. Comb. Theory B, 1981)

Pseudosimilar vertices in a graph. - Robert J. Kimble Jr.; Allen J. Schwenk; Paul K. Stockmeyer (J. Graph Theory, 1981)

An Introduction to Chromatic Sums. - Ewa M. Kubicka; Allen J. Schwenk (ACM Conference on Computer Science, 1989)

Enumeration of Hamiltonian cycles in certain generalized Petersen graphs. - Allen J. Schwenk (J. Comb. Theory B, 1989)

Tight bounds on the chromatic sum of a connected graph. - Carsten Thomassen; Paul Erdös; Yousef Alavi; Paresh J. Malde; Allen J. Schwenk (J. Graph Theory, 1989)

A Matter of Degree. - Gary Chartrand; Héctor Hevia; Ortrud Oellermann; Farrokh Saba; Allen J. Schwenk (SIAM J. Discret. Math., 1989)

Reconstruction of sequences. - Bennet Manvel; Aaron Meyerowitz; Allen J. Schwenk; K. Smith; Paul K. Stockmeyer (Discret. Math., 1991)

The Color-Degree Matrix and the Number of Multicolored Trees in Star Decompositions. - J. Q. Liu; Allen J. Schwenk (J. Comb. Theory B, 1994)

What is the Correct Way to Seed a Knockout Tournament? - Allen J. Schwenk (Am. Math. Mon., 2000)

Efficient dominating sets in labeled rooted oriented trees. - Allen J. Schwenk; Bill Quan Yue (Discret. Math., 2005)

Minimum edge cuts in diameter 2 graphs. - Allan Bickle; Allen J. Schwenk (Discuss. Math. Graph Theory, 2019)

Corrigendum to "Minimum edge cuts in diameter 2 graphs". - Allan Bickle; Allen J. Schwenk (Discuss. Math. Graph Theory, 2025)