A Note on the Generation of Rosary Permutations. - Ronald C. Read (Commun. ACM, 1972)

On the cell-growth problem for arbitrary polygons. - Frank Harary; Edgar M. Palmer; Ronald C. Read (Discret. Math., 1975)

Bounds on Backtrack Algorithms for Listing Cycles, Paths, and Spanning Trees. - Ronald C. Read; Robert E. Tarjan (Networks, 1975)

The graph isomorphism disease. - Ronald C. Read; Derek G. Corneil (J. Graph Theory, 1977)

Orderly algorithms for generating restricted classes of graphs. - Charles J. Colbourn; Ronald C. Read (J. Graph Theory, 1979)

On the construction of the self-complementary graphs on 12 nodes. - Marg Kropar; Ronald C. Read (J. Graph Theory, 1979)

Number of labeled 4-regular graphs. - Ronald C. Read; Nicholas C. Wormald (J. Graph Theory, 1980)

Counting the 10-point graphs by partition. - Ronald C. Read; Nicholas C. Wormald (J. Graph Theory, 1981)

The enumeration of stack polytopes and simplical clusters. - F. Hering; Ronald C. Read; Geoffrey C. Shephard (Discret. Math., 1982)

Enumeration of labelled multigraphs by degree parities. - Ronald C. Read; Robert W. Robinson (Discret. Math., 1982)

Orientations of circle graphs. - Ronald C. Read; Doron Rotem; Jorge Urrutia (J. Graph Theory, 1982)

The enumeration of transitive self-complementary digraphs. - N. Hegde; Ronald C. Read; M. R. Sridharan (Discret. Math., 1983)

A new system for the designation of chemical compounds. 1. Theoretical preliminaries and the coding of acyclic compounds. - Ronald C. Read (J. Chem. Inf. Comput. Sci., 1983)

Some Hamilton Paths and a Minimal Change Algorithm. - Peter Eades; Michael Hickey; Ronald C. Read (J. ACM, 1984)

A new system for the designation of chemical compounds. 2. Coding of cyclic compounds. - Ronald C. Read (J. Chem. Inf. Comput. Sci., 1985)

Cataloguing the graphs on 10 vertices. - R. D. Cameron; Charles J. Colbourn; Ronald C. Read; Nicholas C. Wormald (J. Graph Theory, 1985)

On the construction and enumeration of minimal blocks. - Ronald C. Read; Guanzhang Hu (J. Graph Theory, 1987)

A note on the chromatic uniqueness of W10. - Ronald C. Read (Discret. Math., 1988)

Chemistry and Discrete Mathematics. - Ronald C. Read (Discret. Appl. Math., 1996)

A Note on the Stockhausen Problem. - Ronald C. Read; Lily Yen (J. Comb. Theory A, 1996)

The knot book: An elementary introduction to the mathematical theory of knots. - Ronald C. Read (Complex., 1997)

Combinatorial problems in the theory of music. - Ronald C. Read (Discret. Math., 1997)

Chromatic polynomials of homeomorphism classes of graphs. - Ronald C. Read; Earl Glen Whitehead Jr. (Discret. Math., 1999)

The Tutte polynomial for homeomorphism classes of graphs. - Ronald C. Read; Earl Glen Whitehead Jr. (Discret. Math., 2002)

Counting Claw-Free Cubic Graphs. - Edgar M. Palmer; Ronald C. Read; Robert W. Robinson (SIAM J. Discret. Math., 2002)

The asymptotic number of claw-free cubic graphs. - Brendan D. McKay; Edgar M. Palmer; Ronald C. Read; Robert W. Robinson (Discret. Math., 2003)

Chain polynomials of graphs. - Ronald C. Read (Discret. Math., 2003)

Chromatic Equivalence of Generalized Ladder Graphs. - Stephen Guattery; Gary Haggard; Ronald C. Read (Ars Comb., 2005)

A note on chain lengths and the Tutte polynomial. - Ronald C. Read; Earl Glen Whitehead Jr. (Discret. Math., 2008)

A brute-force method for studying the chromatic properties of homomorphic graphs. - Ronald C. Read (Ars Comb., 2010)