Ronald C. Read

Publication Activity (10 Years)

Years Active: 1972-2010
Publications (10 Years): 0

Publications

Ronald C. Read
A brute-force method for studying the chromatic properties of homomorphic graphs. Ars Comb. 96 (2010)
Ronald C. Read, Earl Glen Whitehead Jr.
A note on chain lengths and the Tutte polynomial. Discret. Math. 308 (10) (2008)
Stephen Guattery, Gary Haggard, Ronald C. Read
Chromatic Equivalence of Generalized Ladder Graphs. Ars Comb. 75 (2005)
Brendan D. McKay, Edgar M. Palmer, Ronald C. Read, Robert W. Robinson
The asymptotic number of claw-free cubic graphs. Discret. Math. 272 (1) (2003)
Ronald C. Read
Chain polynomials of graphs. Discret. Math. 265 (1-3) (2003)
Ronald C. Read, Earl Glen Whitehead Jr.
The Tutte polynomial for homeomorphism classes of graphs. Discret. Math. 243 (1-3) (2002)
Edgar M. Palmer, Ronald C. Read, Robert W. Robinson
Counting Claw-Free Cubic Graphs. SIAM J. Discret. Math. 16 (1) (2002)
Ronald C. Read, Earl Glen Whitehead Jr.
Chromatic polynomials of homeomorphism classes of graphs. Discret. Math. 204 (1-3) (1999)
Ronald C. Read
Combinatorial problems in the theory of music. Discret. Math. (1997)
Ronald C. Read
The knot book: An elementary introduction to the mathematical theory of knots. Complex. 2 (4) (1997)
Ronald C. Read, Lily Yen
A Note on the Stockhausen Problem. J. Comb. Theory, Ser. A 76 (1) (1996)
Ronald C. Read
Chemistry and Discrete Mathematics. Discret. Appl. Math. 67 (1-3) (1996)
Ronald C. Read
. Discret. Math. 69 (3) (1988)
Ronald C. Read, Guanzhang Hu
On the construction and enumeration of minimal blocks. J. Graph Theory 11 (4) (1987)
R. D. Cameron, Charles J. Colbourn, Ronald C. Read, Nicholas C. Wormald
Cataloguing the graphs on 10 vertices. J. Graph Theory 9 (4) (1985)
Ronald C. Read
A new system for the designation of chemical compounds. 2. Coding of cyclic compounds. J. Chem. Inf. Comput. Sci. 25 (2) (1985)
Peter Eades, Michael Hickey, Ronald C. Read
Some Hamilton Paths and a Minimal Change Algorithm. J. ACM 31 (1) (1984)
Ronald C. Read
A new system for the designation of chemical compounds. 1. Theoretical preliminaries and the coding of acyclic compounds. J. Chem. Inf. Comput. Sci. 23 (3) (1983)
N. Hegde, Ronald C. Read, M. R. Sridharan
The enumeration of transitive self-complementary digraphs. Discret. Math. 47 (1983)
Ronald C. Read, Robert W. Robinson
Enumeration of labelled multigraphs by degree parities. Discret. Math. 42 (1) (1982)
F. Hering, Ronald C. Read, Geoffrey C. Shephard
The enumeration of stack polytopes and simplical clusters. Discret. Math. 40 (2-3) (1982)
Ronald C. Read, Doron Rotem, Jorge Urrutia
Orientations of circle graphs. J. Graph Theory 6 (3) (1982)
Ronald C. Read, Nicholas C. Wormald
Counting the 10-point graphs by partition. J. Graph Theory 5 (2) (1981)
Ronald C. Read, Nicholas C. Wormald
Number of labeled 4-regular graphs. J. Graph Theory 4 (2) (1980)
Marg Kropar, Ronald C. Read
On the construction of the self-complementary graphs on 12 nodes. J. Graph Theory 3 (2) (1979)
Charles J. Colbourn, Ronald C. Read
Orderly algorithms for generating restricted classes of graphs. J. Graph Theory 3 (2) (1979)
Ronald C. Read, Derek G. Corneil
The graph isomorphism disease. J. Graph Theory 1 (4) (1977)
Frank Harary, Edgar M. Palmer, Ronald C. Read
On the cell-growth problem for arbitrary polygons. Discret. Math. 11 (3) (1975)
Ronald C. Read, Robert E. Tarjan
Bounds on Backtrack Algorithms for Listing Cycles, Paths, and Spanning Trees. Networks 5 (3) (1975)
Ronald C. Read
A Note on the Generation of Rosary Permutations. Commun. ACM 15 (8) (1972)