Downloadable Publications

• ref 70. (with S. C. Cater) Exponents of 2 in the numbers of unlabeled graphs and tournaments, Congr. Numer. 82 (1992), 139-155. (PostScript) (PDF)

• ref 71. (with N. C. Wormald) Amost all cubic graphs are hamiltonian, Random Structures Algorithms 3 (1992), 117-125. (PostScript) (PDF)

• ref 72. (with E. M. Palmer and R. C. Read) Balancing the n-cube: A census of colorings, J. Algebraic. Combin. 1 (1992), 257-273. (PostScript) (PDF)

• ref 74. (with E. M. Palmer and F. Harary) Counting free binary trees admitting a given height, J. Combin. Inform. System Sci. 17 (1992), 175-181. (PostScript) (PDF)

• ref 75. (with T. R. Walsh) Inversion of cycle index sum relations for 2- and 3-connected graphs, J. Combin. Theory Ser. B. 57 (1993), 289-308. (PostScript) (PDF)
• Tables for Reference 75 (PostScript) (PDF)

• ref 76. (with S. C. Cater) Two-parts of unlabeled tournament numbers, Proc. First Estonian Conf. on Graphs and Applications (M. Kilp and U. Nummert, eds.), Tartu Univ., Tartu (1993), 62-73. (PostScript) (PDF)

• ref 77. (with D. M. Gordon and F. Harary) Minimum degree games for graphs, Discrete Math. 128 (1994), 151-163. (PostScript) (PDF)

• ref 78. (with N. C. Wormald) Almost all regular graphs are hamiltonian, Random Structures Algorithms 5 (1994), 363-374. (PostScript) (PDF)

• ref 79. (with W. D. Potter, J. A. Miller, K. J. Kochut, and D. Z. Redys) Using the genetic algorithm to find snake-in-the-box codes, Proc. Seventh Internat. Conf. Industrial \& Engineering Appl. Artificial Intelligence and Expert Systems, Austin, Texas (1994), 421-426. (PostScript) (PDF)

• ref 80. Counting digraphs with restrictions on the strong components, Combinatorics and Graph Theory '95 (T.-H. Ku, ed.), World Scientific, Singapore (1995), 343-354. (PostScript) (PDF)

• ref 81. (with A. Frieze, M. R. Jerrum, M.S.O. Molloy, and N. C. Wormald) Generating and counting Hamilton cycles in random regular graphs, J. Algorithms 21 (1996), 176-198. (PostScript) (PDF)

• ref 82. (with M. S. O. Molloy, H. Robalewska, and N. C. Wormald) 1-factorisations of random regular graphs, Random Structures Algorithms 10 (1997), 305-321. (PostScript) (PDF)

• ref 83. (with B. D. McKay) Asymptotic enumeration of eulerian circuits in the complete graph, Combin. Probab. Comput. 7 (1998), 437-449. (PostScript) (PDF)

• ref 84. (with N. C. Wormald) Hamilton cycles containing randomly selected edges in random regular graphs, Random Structures Algorithms 19 (2001), 128-147. (PostScript) (PDF)

• ref 85. (with F. Harary) Identity digraphs of minimum size, Congr. Numer. 152 (2001), 139-147. (PostScript) (PDF)

• ref 86. (with S. C. Cater and F. Harary) One-color triangle avoidance games, Congr. Numer. 153 (2001), 211-221. (PostScript) (PDF)

• ref 87. (with E. M. Palmer and R. C. Read) Counting claw-free cubic graphs, SIAM J. Discrete Math. 16 (2002), 65-73. (PostScript) (PDF)

• ref 88. (with B. D. McKay, E. M. Palmer, and R. C. Read) The asymptotic number of claw-free cubic graphs, Discrete Math. 272 (2003), 107-118. (PostScript) (PDF)

• ref 89. (with A. S. Chowdhury, S. M. Bhandarkar, and J. C. Yu) Virtual craniofacial reconstruction from computed tomography image sequences exhibiting multiple fractures, Proc. Thirteenth IEEE Internat. Conf. on Image Processing (ICIP), Atlanta, GA (2006), 1173-1176. (PostScript) (PDF)

• ref 90. (with A. S. Chowdhury, S. M. Bhandarkar, and J. C. Yu) Novel graph theoretic enhancements to ICP-based virtual craniofacial reconstruction, Proc. Fourth IEEE Symp. on Biomedical Imaging (ISBI), Metro Washington, DC (2007), 1136-1139. (PostScript) (PDF)

back to Robinson's home page