Ronald C. Read

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