Read, Ronald C.
Read, R.C.
Read, Ronald C., 1924-2019
Ronald C. Read mathématicien canadien
VIAF ID: 229285086 ( Personal )
Permalink: http://viaf.org/viaf/229285086
Preferred Forms
- 200 _ | ‡a Read ‡b Ronald C.
- 100 1 _ ‡a Read, R.C.
-
-
-
-
-
-
-
- 100 1 _ ‡a Read, Ronald C.
- 100 1 _ ‡a Read, Ronald C.
-
-
- 100 1 _ ‡a Read, Ronald C., ‡d 1924-2019
-
- 100 0 _ ‡a Ronald C. Read ‡c mathématicien canadien
4xx's: Alternate Name Forms (17)
Works
Title | Sources |
---|---|
An algorithm for labelling and representing a tree according to the rules for nodal nomenclature | |
An atlas of graphs | |
Broken wheels are SLC | |
Chain polynomials and link polynomials | |
Combinatorial Enumeration of Groups, Graphs, and Chemical Compounds | |
Combinatorics & Optimization, Chromatic Polynomials of Homeomorphism Classes of Graphs. | |
Computing with three-colourable graphs : a survey | |
Connectivity and chromatic uniqueness | |
Counting the 10-point graphs by partition | |
The dimer problem for narrow rectangule arrays : a unified method of solution, and some extensions | |
The enumeration of polyhexes with caterpillar shape | |
Enumeration of unlabelled graphs on 6 to 10 vertices according to partition. Summary of results | |
Graph theory and computing | |
Graphical enumeration by cycle-index sums : first steps toward a unified treatment | |
Happy birthday theme & variations | |
An improved method for computing the chromatic polynomials of sparse graphs | |
Kombinatorische Anzahlbestimmungen für Gruppen, Graphen und chemische Verbindungen. | |
The legacy of Pʹolya's paper : fifty years of Pʹolya theory | |
Love in a magical way, ©1997: | |
A mathematical background for economists and social scientists | |
Methods for computer display and manipulation of graphs, and the corresponding algorithms | |
A new method for drawing a planar graph given the cyclic order of the edges at each vertex | |
A new system for the designation of chemical compounds for the purpose of data retrieval. | |
The number of labelled 4-regular graphs | |
On the chromatic properties of graphs up to 10 vertices | |
On the construction and enumeration of minimal blocks | |
On the extremal graphs with stability number one more than the connectivity | |
On the generation and enumeration of homeomorphically irreducible trees | |
On the tiling of 2xn rectangles, and the evaluation of Hadamard products | |
Orientations of circle graphs | |
Proceedings of the second Caribbean Conference in Combinatorics and Computing : University of the West Indies, Cave Hill, Barbados, January 4-7, 1977 | |
Read's conjecture | |
The Stockhausen problem and its generalizations, 1995: | |
Tangrams | |
Tangrams : 330 puzzles | |
リード予想 |