default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRonald C. Read
Person information
- affiliation: University of Waterloo, Waterloo, Ontario, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2010
[j30]Ronald C. Read:
A brute-force method for studying the chromatic properties of homomorphic graphs. Ars Comb. 96 (2010)- 2008
- [j29]Ronald C. Read, Earl Glen Whitehead Jr.:
A note on chain lengths and the Tutte polynomial. Discret. Math. 308(10): 1826-1829 (2008) - 2005
- [j28]Stephen Guattery, Gary Haggard, Ronald C. Read:
Chromatic Equivalence of Generalized Ladder Graphs. Ars Comb. 75 (2005) - 2003
- [j27]Ronald C. Read:
Chain polynomials of graphs. Discret. Math. 265(1-3): 213-235 (2003) - [j26]Brendan D. McKay
, Edgar M. Palmer, Ronald C. Read, Robert W. Robinson:
The asymptotic number of claw-free cubic graphs. Discret. Math. 272(1): 107-118 (2003) - 2002
- [j25]Ronald C. Read, Earl Glen Whitehead Jr.:
The Tutte polynomial for homeomorphism classes of graphs. Discret. Math. 243(1-3): 267-272 (2002) - [j24]Edgar M. Palmer, Ronald C. Read, Robert W. Robinson:
Counting Claw-Free Cubic Graphs. SIAM J. Discret. Math. 16(1): 65-73 (2002) - 1999
- [j23]Ronald C. Read, Earl Glen Whitehead Jr.:
Chromatic polynomials of homeomorphism classes of graphs. Discret. Math. 204(1-3): 337-356 (1999) - 1997
- [j22]Ronald C. Read:
The knot book: An elementary introduction to the mathematical theory of knots. Complex. 2(4): 23-25 (1997) - [j21]Ronald C. Read:
Combinatorial problems in the theory of music. Discret. Math. 167-168: 543-551 (1997) - 1996
- [j20]Ronald C. Read:
Chemistry and Discrete Mathematics. Discret. Appl. Math. 67(1-3): 1-4 (1996) - [j19]Ronald C. Read, Lily Yen:
A Note on the Stockhausen Problem. J. Comb. Theory A 76(1): 1-10 (1996) - 1988
- [j18]Ronald C. Read:
A note on the chromatic uniqueness of W10. Discret. Math. 69(3): 317 (1988) - 1987
- [j17]Ronald C. Read, Guanzhang Hu:
On the construction and enumeration of minimal blocks. J. Graph Theory 11(4): 539-553 (1987) - 1985
- [j16]Ronald C. Read:
A new system for the designation of chemical compounds. 2. Coding of cyclic compounds. J. Chem. Inf. Comput. Sci. 25(2): 116-128 (1985) - [j15]R. D. Cameron, Charles J. Colbourn, Ronald C. Read, Nicholas C. Wormald:
Cataloguing the graphs on 10 vertices. J. Graph Theory 9(4): 551-562 (1985) - 1984
- [j14]Peter Eades, Michael Hickey, Ronald C. Read:
Some Hamilton Paths and a Minimal Change Algorithm. J. ACM 31(1): 19-29 (1984) - 1983
- [j13]N. Hegde, Ronald C. Read, M. R. Sridharan:
The enumeration of transitive self-complementary digraphs. Discret. Math. 47: 109-112 (1983) - [j12]Ronald C. Read:
A new system for the designation of chemical compounds. 1. Theoretical preliminaries and the coding of acyclic compounds. J. Chem. Inf. Comput. Sci. 23(3): 135-149 (1983) - 1982
- [j11]F. Hering, Ronald C. Read, Geoffrey C. Shephard:
The enumeration of stack polytopes and simplical clusters. Discret. Math. 40(2-3): 203-217 (1982) - [j10]Ronald C. Read, Robert W. Robinson:
Enumeration of labelled multigraphs by degree parities. Discret. Math. 42(1): 99-105 (1982) - [j9]Ronald C. Read, Doron Rotem, Jorge Urrutia:
Orientations of circle graphs. J. Graph Theory 6(3): 325-341 (1982) - 1981
- [j8]Ronald C. Read, Nicholas C. Wormald:
Counting the 10-point graphs by partition. J. Graph Theory 5(2): 183-196 (1981) - 1980
- [j7]Ronald C. Read, Nicholas C. Wormald:
Number of labeled 4-regular graphs. J. Graph Theory 4(2): 203-212 (1980) - 1979
- [j6]Marg Kropar, Ronald C. Read:
On the construction of the self-complementary graphs on 12 nodes. J. Graph Theory 3(2): 111-125 (1979) - [j5]Charles J. Colbourn, Ronald C. Read:
Orderly algorithms for generating restricted classes of graphs. J. Graph Theory 3(2): 187-195 (1979) - 1977
- [j4]Ronald C. Read, Derek G. Corneil:
The graph isomorphism disease. J. Graph Theory 1(4): 339-363 (1977) - 1975
- [j3]Frank Harary, Edgar M. Palmer, Ronald C. Read:
On the cell-growth problem for arbitrary polygons. Discret. Math. 11(3): 371-389 (1975) - [j2]Ronald C. Read, Robert E. Tarjan:
Bounds on Backtrack Algorithms for Listing Cycles, Paths, and Spanning Trees. Networks 5(3): 237-252 (1975) - 1972
- [j1]Ronald C. Read:
A Note on the Generation of Rosary Permutations. Commun. ACM 15(8): 775 (1972)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 21:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
