Ronald C. Read

From MaRDI portal
Person:193546

Available identifiers

zbMath Open read.ronald-cDBLP35/3441WikidataQ7364715 ScholiaQ7364715MaRDI QIDQ193546

List of research outcomes





PublicationDate of PublicationType
Combinatorial enumeration of groups, graphs, and chemical compounds. Translated from the German by Dorothee Aeppli2024-05-14Paper
https://portal.mardi4nfdi.de/entity/Q31181142012-03-01Paper
A note on chain lengths and the Tutte polynomial2008-11-12Paper
https://portal.mardi4nfdi.de/entity/Q57044152005-11-15Paper
https://portal.mardi4nfdi.de/entity/Q54635862005-08-04Paper
https://portal.mardi4nfdi.de/entity/Q44582122004-03-17Paper
The asymptotic number of claw-free cubic graphs.2003-12-04Paper
Chain polynomials of graphs2003-05-25Paper
Counting Claw-Free Cubic Graphs2003-01-05Paper
The Tutte polynomial for homeomorphism classes of graphs2002-07-03Paper
Cellular structures determined by polygons and trees2002-04-21Paper
Graph theory and the amateur cryptographer2000-11-26Paper
Chromatic polynomials of homeomorphism classes of graphs1999-09-02Paper
https://portal.mardi4nfdi.de/entity/Q42231591998-12-15Paper
https://portal.mardi4nfdi.de/entity/Q43420161997-07-01Paper
A note on the Stockhausen problem1997-06-25Paper
Combinatorial problems in the theory of music1997-06-09Paper
Chemistry and discrete mathematics1996-11-21Paper
https://portal.mardi4nfdi.de/entity/Q48737721996-04-22Paper
https://portal.mardi4nfdi.de/entity/Q48464961995-11-26Paper
https://portal.mardi4nfdi.de/entity/Q31397641994-11-29Paper
https://portal.mardi4nfdi.de/entity/Q43044271994-09-12Paper
Balancing the \(n\)-cube: A census of colorings1994-02-02Paper
https://portal.mardi4nfdi.de/entity/Q57525881990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38190841988-01-01Paper
A note on the chromatic uniqueness of \(W_ 10\)1988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47347761988-01-01Paper
Pólya's Theorem and Its Progeny1987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38326081987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37579301987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37927021987-01-01Paper
On the construction and enumeration of minimal blocks1987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37289291986-01-01Paper
On the enumeration of a class of plane multigraphs1986-01-01Paper
Cataloguing the graphs on 10 vertices1985-01-01Paper
Some Hamilton Paths and a Minimal Change Algorithm1984-01-01Paper
The enumeration of transitive selfcomplementary digraphs1983-01-01Paper
The enumeration of stack polytopes and simplicial clusters1982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33098521982-01-01Paper
The dimer problem for narrow rectangular arrays: A unified method of solution, and some extensions1982-01-01Paper
Enumeration of labelled multigraphs by degree parities1982-01-01Paper
Orientations of circle graphs1982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39630311981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39242281981-01-01Paper
Counting the 10-point graphs by partition1981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38639061980-01-01Paper
Number of labeled 4-regular graphs1980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39367401979-01-01Paper
Orderly algorithms for graph generation1979-01-01Paper
Orderly algorithms for generating restricted classes of graphs1979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38890771979-01-01Paper
On the construction of the self-complementary graphs on 12 nodes1979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41720671978-01-01Paper
On general dissections of a polygon1978-01-01Paper
On the Principal Edge Tripartition of a Graph1978-01-01Paper
Every one a Winner or how to Avoid Isomorphism Search when Cataloguing Combinatorial Configurations1978-01-01Paper
A note on permutations without runs of given length1978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38777161978-01-01Paper
The graph isomorphism disease1977-01-01Paper
Bounds on Backtrack Algorithms for Listing Cycles, Paths, and Spanning Trees1975-01-01Paper
On the cell-growth problem for arbitrary polygons1975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40445901974-01-01Paper
On the Number of Plane 2-Trees1973-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56595531972-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56685041972-01-01Paper
Cospectral Graphs and Digraphs1971-01-01Paper
The enumeration of tree-like polyhexes1970-01-01Paper
Coloured Graphs: A Correction and Extension1970-01-01Paper
Some Unusual Enumeration Problems1970-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56071121970-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56595521970-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55884391969-01-01Paper
The Use of S-Functions in Combinatorial Analysis1968-01-01Paper
An introduction to chromatic polynomials1967-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56038451967-01-01Paper
A Type of "Gambler's Ruin" Problem1966-01-01Paper
On the Number of Self-Complementary Graphs and Digraphs1963-01-01Paper
Contributions to the Cell Growth Problem1962-01-01Paper
Euler Graphs on Labelled Nodes1962-01-01Paper
Card-Guessing with Information--A Problem in Probability1962-01-01Paper
A note on the number of functional digraphs1961-01-01Paper
Production Functions with Restricted Input Shares1961-01-01Paper
The Enumeration of Locally Restricted Graphs (II)1960-01-01Paper
The Number of k-Coloured Graphs on Labelled Nodes1960-01-01Paper
The Enumeration of Locally Restricted Graphs (I)1959-01-01Paper
Maximal Circuits in Critical Graphs1957-01-01Paper

Research outcomes over time

This page was built for person: Ronald C. Read