Ronald C. Read

Ronald C. Read's AcademicInfluence.com Rankings

Ronald C. Read

Mathematics

#2616

World Rank

#4007

Historical Rank

Number Theory

#263

World Rank

#332

Historical Rank

Algebra

#274

World Rank

#391

Historical Rank

Measure Theory

#2358

World Rank

#2820

Historical Rank

mathematics Degrees

Download Badge

Mathematics

Why Is Ronald C. Read Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Ronald Cedric Read was a British mathematician, latterly a professor emeritus of mathematics at the University of Waterloo, Canada. He published many books and papers, primarily on enumeration of graphss, graph isomorphism, chromatic polynomials, and particularly, the use of computers in graph-theoretical research. A majority of his later work was done in Waterloo. Read received his Ph.D. in graph theory from the University of London.

(See a Problem?)

Ronald C. Read's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

The graph isomorphism disease (1977) (521)
The knot book: An elementary introduction to the mathematical theory of knots (1997) (445)
Combinatorial Enumeration Of Groups, Graphs, And Chemical Compounds (1988) (412)
Graph theory and computing (1972) (300)
An Atlas of Graphs (1999) (273)
Bounds on Backtrack Algorithms for Listing Cycles, Paths, and Spanning Trees (1975) (270)
Every one a Winner or how to Avoid Isomorphism Search when Cataloguing Combinatorial Configurations (1978) (244)
An introduction to chromatic polynomials (1968) (216)
The Enumeration of Locally Restricted Graphs (I) (1959) (105)
Cospectral Graphs and Digraphs (1971) (101)
The enumeration of tree-like polyhexes (1970) (99)
On the Principal Edge Tripartition of a Graph (1978) (93)
THE USE OF RADIOACTIVE SODIUM CHROMATE TO EVALUATE THE LIFE SPAN OF THE RED BLOOD CELL IN HEALTH AND CERTAIN HEMATOLOGIC DISORDERS (1954) (88)
Contributions to the Cell Growth Problem (1962) (72)
On the Number of Self-Complementary Graphs and Digraphs (1963) (63)
The Use of S-Functions in Combinatorial Analysis (1968) (58)
Chromatic polynomials of homeomorphism classes of graphs (1999) (56)
Every one a winner (1978) (52)
On the cell-growth problem for arbitrary polygons (1975) (46)
Some Hamilton Paths and a Minimal Change Algorithm (1984) (44)
THE CODING OF VARIOUS KINDS OF UNLABELED TREES (1972) (41)
A survey of graph generation techniques (1981) (40)
A new system for the designation of chemical compounds. 1. Theoretical preliminaries and the coding of acyclic compounds (1983) (36)
Orderly algorithms for generating restricted classes of graphs (1979) (36)
Orderly algorithms for graph generation (1979) (34)
Combinatorial problems in the theory of music (1997) (29)
Is the null-graph a pointless concept? (1974) (28)
The Number of k-Coloured Graphs on Labelled Nodes (1960) (25)
Some Unusual Enumeration Problems (1970) (25)
On general dissections of a polygon (1978) (24)
Cataloguing the graphs on 10 vertices (1985) (23)
Balancing the n-Cube: A Census of Colorings (1992) (23)
Euler Graphs on Labelled Nodes (1962) (21)
A note on the number of functional digraphs (1961) (20)
THE CHORD INTERSECTION PROBLEM 1 (1979) (20)
On the Number of Plane 2‐Trees (1973) (19)
Cellular Structures Determined by Polygons and Trees (2000) (19)
Number of labeled 4-regular graphs (1980) (18)
The Tutte polynomial for homeomorphism classes of graphs (2002) (15)
The number of ways to label a structure (1967) (14)
Tangrams: 330 Puzzles (1965) (14)
A new system for the designation of chemical compounds. 2. Coding of cyclic compounds (1985) (12)
An Atlas of Graphs (Mathematics) (2005) (12)
Orientations of circle graphs (1982) (11)
A mathematical background for economists and social scientists (1972) (11)
Card-Guessing with Information—A Problem in Probability (1962) (10)
Enumeration of labelled multigraphs by degree parities (1982) (10)
Production Functions with Restricted Input Shares (1961) (9)
A note on the chromatic uniqueness of W10 (1988) (9)
Counting Claw-Free Cubic Graphs (2002) (9)
The asymptotic number of claw-free cubic graphs (2003) (8)
Pólya's Theorem and Its Progeny (1987) (8)
Chain polynomials of graphs (2003) (8)
Maximal Circuits in Critical Graphs (1957) (7)
Coloured Graphs: A Correction and Extension (1970) (7)
A note on the generation of rosary permutations (1972) (7)
A note on permutations without runs of given length (1978) (7)
On general dissections of a polygon (1978) (7)
Demand Theory without a Utility Index—A Comment (1958) (6)
A Note on the Stockhausen Problem (1996) (6)
The dimer problem for narrow rectangular arrays: A unified method of solution, and some extensions (1982) (6)
Counting the 10-point graphs by partition (1981) (5)
The probability of a given 1-choice structure (1966) (5)
Blood pressure and osmolarity changes in the dumping syndrome. (1961) (5)
Some recent results in chemical enumeration (1972) (4)
On the construction of the self-complementary graphs on 12 nodes (1979) (4)
Prospects for Graph Theory Algorithms (1993) (4)
Graph Theory and the Amateur Cryptographer (1997) (4)
On the construction and enumeration of minimal blocks (1987) (3)
On the enumeration of a class of plane multigraphs (1986) (3)
The enumeration of stack polytopes and simplical clusters (1982) (3)
THE APPLICATION OF DIGITAL COMPUTER TECHNIQUES TO THE STUDY OF GRAPH-THEORETICAL AND RELATED COMBINATORIAL PROBLEMS. (1969) (2)
A simple device for blood-flow control in extracorporeal circuits. (1982) (2)
AN ANALOGUE METHOD FOR STUDYING MULTIPLE SCATTERING (1957) (2)
The Legacy of Pólya’s Paper: Fifty Years of Pólya Theory (1987) (2)
A Type of "Gambler's Ruin" Problem (1966) (2)
Theory and calculations for a spin glass (1985) (1)
A note on chain lengths and the Tutte polynomial (2008) (1)
Chromatic Equivalence of Generalized Ladder Graphs (2005) (1)
The enumeration of transitive self-complementary digraphs (1983) (0)
A brute-force method for studying the chromatic properties of homomorphic graphs (2010) (0)
Blood flow through the collapsed lung. (1979) (0)
Chemistry and Discrete Mathematics (1996) (0)
Asymptotic Evaluation of the Number of Combinations (1987) (0)
The Graph Theorists Who Count—and What They Count (1981) (0)
CORR 2000-14 Chain Polynomials and Link Polynomials (2000) (0)
PDFlib PLOP: PDF Linearization, Optimization, Protection Page inserted by evaluation version (2003) (0)
Problems for Solution: 5044-5050 (1962) (0)
Happy birthday theme & variations (1935) (0)
Solutions to Exercises Chapter 11 : Graphs 1 (2000) (0)
Star Tangrams (2016) (0)

This paper list is powered by the following services:

Other Resources About Ronald C. Read

en.wikipedia.org

What Schools Are Affiliated With Ronald C. Read?

Ronald C. Read is affiliated with the following schools:

University of Waterloo

Ronald C. Read's Academic­Influence.com Rankings

Why Is Ronald C. Read Influential?

Ronald C. Read's Published Works

Published Works

Other Resources About Ronald C. Read

What Schools Are Affiliated With Ronald C. Read?

Ronald C. Read's AcademicInfluence.com Rankings