Ronald C. Read - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 24 from 24

2010

A brute-force method for studying the chromatic properties of homomorphic graphsRonald C. Read. arscom, 96, 2010.

2008

A note on chain lengths and the Tutte polynomialRonald C. Read, Earl Glen Whitehead Jr.. DM, 308(10):1826-1829, 2008. [doi]

2005

Chromatic Equivalence of Generalized Ladder GraphsStephen Guattery, Gary Haggard, Ronald C. Read. arscom, 75, 2005.

2003

The asymptotic number of claw-free cubic graphsBrendan D. McKay, Edgar M. Palmer, Ronald C. Read, Robert W. Robinson. DM, 272(1):107-118, 2003. [doi]

Chain polynomials of graphsRonald C. Read. DM, 265(1-3):213-235, 2003. [doi]

2002

Counting Claw-Free Cubic GraphsEdgar M. Palmer, Ronald C. Read, Robert W. Robinson. siamdm, 16(1):65-73, 2002. [doi]

The Tutte polynomial for homeomorphism classes of graphsRonald C. Read, Earl Glen Whitehead Jr.. DM, 243(1-3):267-272, 2002. [doi]

1999

Chromatic polynomials of homeomorphism classes of graphsRonald C. Read, Earl Glen Whitehead Jr.. DM, 204(1-3):337-356, 1999. [doi]

1997

The knot book: An elementary introduction to the mathematical theory of knotsRonald C. Read. complexity, 2(4):23-25, 1997. [doi]

1996

A Note on the Stockhausen ProblemRonald C. Read, Lily Yen. JCT, 76(1):1-10, 1996. [doi]

Chemistry and Discrete MathematicsRonald C. Read. DAM, 67(1-3):1-4, 1996. [doi]

1988

A note on the chromatic uniqueness of W::10::Ronald C. Read. DM, 69(3):317, 1988. [doi]

1987

On the construction and enumeration of minimal blocksRonald C. Read, Guanzhang Hu. jgt, 11(4):539-553, 1987. [doi]

1985

A new system for the designation of chemical compounds. 2. Coding of cyclic compoundsRonald C. Read. jcisd, 25(2):116-128, 1985. [doi]

1984

Some Hamilton Paths and a Minimal Change AlgorithmPeter Eades, Michael Hickey, Ronald C. Read. JACM, 31(1):19-29, 1984. [doi]

1983

A new system for the designation of chemical compounds. 1. Theoretical preliminaries and the coding of acyclic compoundsRonald C. Read. jcisd, 23(3):135-149, 1983. [doi]

1981

Counting the 10-point graphs by partitionRonald C. Read, Nicholas C. Wormald. jgt, 5(2):183-196, 1981. [doi]

1980

Number of labeled 4-regular graphsRonald C. Read, Nicholas C. Wormald. jgt, 4(2):203-212, 1980. [doi]

1979

Orderly algorithms for generating restricted classes of graphsCharles J. Colbourn, Ronald C. Read. jgt, 3(2):187-195, 1979. [doi]

On the construction of the self-complementary graphs on 12 nodesMarg Kropar, Ronald C. Read. jgt, 3(2):111-125, 1979. [doi]

1977

The graph isomorphism diseaseRonald C. Read, Derek G. Corneil. jgt, 1(4):339-363, 1977. [doi]

1975

On the cell-growth problem for arbitrary polygonsFrank Harary, Edgar M. Palmer, Ronald C. Read. DM, 11(3):371-389, 1975. [doi]

Bounds on Backtrack Algorithms for Listing Cycles, Paths, and Spanning TreesRonald C. Read, Robert E. Tarjan. networks, 5(3):237-252, 1975. [doi]

1972

A Note on the Generation of Rosary PermutationsRonald C. Read. CACM, 15(8):775, 1972.

Sign in or sign up to see more results.

runs on WebDSL