The following pages link to Ronald C. Read (Q193546):
Displaying 50 items.
- (Q686001) (redirect page) (← links)
- Balancing the \(n\)-cube: A census of colorings (Q686003) (← links)
- A note on the number of functional digraphs (Q773288) (← links)
- (Q791528) (redirect page) (← links)
- A note on the occupational degeneracy for dimers on a saturated two- dimensional lattice space (Q791529) (← links)
- A note on chain lengths and the Tutte polynomial (Q952642) (← links)
- The enumeration of transitive selfcomplementary digraphs (Q1055782) (← links)
- On trees of polygons (Q1063618) (← links)
- A new method for solving a class of ballot problems (Q1066902) (← links)
- Path generating functions and continued fractions (Q1072555) (← links)
- On the enumeration of a class of plane multigraphs (Q1084112) (← links)
- More on maximal intersecting families of finite sets (Q1086235) (← links)
- Induced restricted Ramsey theorems for spaces (Q1086252) (← links)
- A note on the chromatic uniqueness of \(W_ 10\) (Q1100213) (← links)
- Chromatic sum equations for rooted cubic planar maps (Q1102303) (← links)
- The asymptotic number of tree-rooted maps on a surface (Q1102304) (← links)
- On \(\sigma\)-polynomials (Q1111560) (← links)
- A note on quadratic \(\sigma\)-polynomials (Q1111562) (← links)
- Isomorphism of two infinite-chromatic triangle-free graphs (Q1124601) (← links)
- Enumeration of labelled multigraphs by degree parities (Q1170254) (← links)
- The enumeration of stack polytopes and simplicial clusters (Q1173286) (← links)
- Classifying 2-extendable generalized Petersen graphs (Q1197056) (← links)
- Resolvable and near-resolvable decompositions of \(DK_ v\) into oriented 4-cycles (Q1207298) (← links)
- On the cell-growth problem for arbitrary polygons (Q1215640) (← links)
- A note on permutations without runs of given length (Q1248515) (← links)
- On general dissections of a polygon (Q1253257) (← links)
- Chromatic polynomials of homeomorphism classes of graphs (Q1300985) (← links)
- Combinatorial problems in the theory of music (Q1356493) (← links)
- Graph theory and the amateur cryptographer (Q1388984) (← links)
- The asymptotic number of claw-free cubic graphs. (Q1415549) (← links)
- On domination and independence numbers of graphs (Q1813991) (← links)
- Elliptic functions, continued fractions and doubled permutations (Q1823245) (← links)
- The irregularity strength of \(K_{m,m}\) is 4 for odd m (Q1823264) (← links)
- The dimer problem for narrow rectangular arrays: A unified method of solution, and some extensions (Q1838973) (← links)
- Chain polynomials of graphs (Q1874363) (← links)
- Chemistry and discrete mathematics (Q1917313) (← links)
- A note on the Stockhausen problem (Q1924233) (← links)
- Taxonomic classes of sets (Q2277267) (← links)
- Some Hamilton Paths and a Minimal Change Algorithm (Q3028353) (← links)
- (Q3118114) (← links)
- (Q3139764) (← links)
- Orderly algorithms for graph generation (Q3208699) (← links)
- Maximal Circuits in Critical Graphs (Q3244861) (← links)
- The Enumeration of Locally Restricted Graphs (I) (Q3263910) (← links)
- The Number of <i>k</i>-Coloured Graphs on Labelled Nodes (Q3270980) (← links)
- Contributions to the Cell Growth Problem (Q3290230) (← links)
- Euler Graphs on Labelled Nodes (Q3291035) (← links)
- Card-Guessing with Information--A Problem in Probability (Q3291974) (← links)
- (Q3309852) (← links)
- The Use of S-Functions in Combinatorial Analysis (Q5551496) (← links)
