Ronald C. Read

发表

On the cell-growth problem for arbitrary polygons

Frank Harary, Edgar M. Palmer, Ronald C. Read, 1975, Discret. Math..

A new system for the designation of chemical compounds. 1. Theoretical preliminaries and the coding of acyclic compounds

Ronald C. Read, 1983, J. Chem. Inf. Comput. Sci..

On the construction and enumeration of minimal blocks

Ronald C. Read, Guanzhang Hu, 1987, J. Graph Theory.

The graph isomorphism disease

Derek G. Corneil, Ronald C. Read, D. Corneil, 1977, J. Graph Theory.

The knot book: An elementary introduction to the mathematical theory of knots

Ronald C. Read, R. Read, 1997, Complex..

Number of labeled 4-regular graphs

Nicholas C. Wormald, Ronald C. Read, N. Wormald, 1980, J. Graph Theory.

Enumeration of labelled multigraphs by degree parities

Robert W. Robinson, Ronald C. Read, 1982, Discret. Math..

A survey of graph generation techniques

Ronald C. Read, 1981 .

Combinatorial problems in the theory of music

Ronald C. Read, 1997, Discret. Math..

Chromatic polynomials of homeomorphism classes of graphs

Ronald C. Read, Earl Glen Whitehead, R. Read, 1999, Discret. Math..

The Tutte polynomial for homeomorphism classes of graphs

Ronald C. Read, Earl Glen Whitehead, 2002, Discret. Math..

The enumeration of tree-like polyhexes †

Frank Harary, Ronald C. Read, 1970 .

Counting the 10-point graphs by partition

Nicholas C. Wormald, Ronald C. Read, 1981, J. Graph Theory.

The enumeration of stack polytopes and simplical clusters

Geoffrey C. Shephard, Ronald C. Read, F. Hering, 1982, Discret. Math..

Prospects for Graph Theory Algorithms

Ronald C. Read, R. Read, 1993 .

THE APPLICATION OF DIGITAL COMPUTER TECHNIQUES TO THE STUDY OF GRAPH-THEORETICAL AND RELATED COMBINATORIAL PROBLEMS.

Ronald C. Read, Clarence King, Charles C. Cadogan, 1969 .

The asymptotic number of claw-free cubic graphs

Brendan D. McKay, Edgar M. Palmer, Robert W. Robinson, 2003, Discret. Math..

A new system for the designation of chemical compounds. 2. Coding of cyclic compounds

Ronald C. Read, 1985, J. Chem. Inf. Comput. Sci..

A Note on the Stockhausen Problem

Ronald C. Read, Lily Yen, 1996, J. Comb. Theory, Ser. A.

A note on chain lengths and the Tutte polynomial

Ronald C. Read, Earl Glen Whitehead, 2008, Discret. Math..

Counting Claw-Free Cubic Graphs

Edgar M. Palmer, Robert W. Robinson, Ronald C. Read, 2002, SIAM J. Discret. Math..

Chromatic Equivalence of Generalized Ladder Graphs

Ronald C. Read, Stephen Guattery, Gary Haggard, 2005, Ars Comb..

Graph theory and computing

Ronald C. Read, Claude Berge, C. Berge, 1972 .

Some Hamilton Paths and a Minimal Change Algorithm

Peter Eades, Michael Hickey, Ronald C. Read, 1984, JACM.

Orderly algorithms for generating restricted classes of graphs

Charles J. Colbourn, Ronald C. Read, 1979, J. Graph Theory.

The enumeration of transitive self-complementary digraphs

Ronald C. Read, M. R. Sridharan, N. Hegde, 1983, Discret. Math..

Cataloguing the graphs on 10 vertices

Charles J. Colbourn, Nicholas C. Wormald, Ronald C. Read, 1985, J. Graph Theory.

A note on the chromatic uniqueness of W10

Ronald C. Read, 1988, Discret. Math..

Chemistry and Discrete Mathematics

Ronald C. Read, 1996, Discret. Appl. Math..

A note on the generation of rosary permutations

Ronald C. Read, R. Read, 1972, Commun. ACM.

A brute-force method for studying the chromatic properties of homomorphic graphs

Ronald C. Read, 2010, Ars Comb..

Chain polynomials of graphs

Ronald C. Read, 2003, Discret. Math..

Orientations of circle graphs

Jorge Urrutia, Doron Rotem, Ronald C. Read, 1982, J. Graph Theory.

On the construction of the self-complementary graphs on 12 nodes

Ronald C. Read, Marg Kropar, 1979, J. Graph Theory.

THE CHORD INTERSECTION PROBLEM 1

Ronald C. Read, 1979 .

Card-Guessing with Information—A Problem in Probability

Ronald C. Read, R. Read, 1962 .

On general dissections of a polygon

Ronald C. Read, 1978 .

The knot book: An elementary introduction to the mathematical theory of knots

Ronald C. Read, 1997 .

THE CODING OF VARIOUS KINDS OF UNLABELED TREES

Ronald C. Read, R. Read, 1972 .

Is the null-graph a pointless concept?

Frank Harary, Ronald C. Read, F. Harary, 1974 .

The dimer problem for narrow rectangular arrays: A unified method of solution, and some extensions

Ronald C. Read, 1982 .

Some recent results in chemical enumeration

Ronald C. Read, R. Read, 1972 .

Some Unusual Enumeration Problems

Ronald C. Read, 1970 .

Tangrams: 330 Puzzles

Ronald C. Read, R. Read, 1965 .

A note on permutations without runs of given length

Ronald C. Read, David M. Jackson, R. Read, 1978 .

Euler graphs on labelled nodes

Ronald C. Read, 1962 .

Orderly algorithms for graph generation

Charles J. Colbourn, Ronald C. Read, 1979 .

The Use of S-Functions in Combinatorial Analysis

Ronald C. Read, R. Read, 1968, Canadian Journal of Mathematics.

Cospectral Graphs and Digraphs

Frank Harary, Abbe Mowshowitz, Ronald C. Read, 1971 .