1980 |
64. An historical encounter with the Four Color Problem.
(with C. E. Wall)
School Science Math. 80
(1980) 49-56. 65. Some ramsey type results on trees versus complete graphs. (with R. J. Gould and A. D. Polimeni) Proceedings of the Tenth Southeastern Conference on Combinatorics, Graph Theory and Computing. Utilitas Mathematica, Winnipeg (1980) 241-249. 66. On ramsey numbers of forests versus nearly complete graphs. (with R. J. Gould and A. D. Polimeni) J. Graph Theory 4 (1980) 233-239. 67. Graph theory and the high school student. (with C. E. Wall) School Science Math. 80 (1980) 479-485. 68. The min_max supergraph. (with R. J. Gould and S. F. Kapoor) Math. Slovaca 30 (1980) 175-179. 69. Balanced ramsey numbers. (with L. Lesniak-Foster and C. E. Wall) Proceedings of the Eleventh Southeastern Conference on Combinatorics, Graph Theory and Computing. Congressus Numerantium 28 (1980) 271-279. |
1981 |
70. Randomly k_axial graphs.
(with D. Burns, S. F. Kapoor and F. Saba)
Bull. Austral. Math. Soc.
23 (1981) 143-158.
71. Bigraphical sets. (with R. J. Gould, A. D. Polimeni and C. E. Wall) Theory and Applications of Graphs. John Wiley & Sons, New York (1981), pp. 181-188. 72. Graphs hamiltonian-connected from a vertex. (with E. A. Nordhaus) Theory and Applications of Graphs. John Wiley & Sons, New York (1981), pp. 189-201. 73. On star-book ramsey numbers. (with A. D. Polimeni, C. C. Rousseau, J. Sheehan and M. J. Stewart) Theory and Applications of Graphs. John Wiley & Sons, New York (1981), pp. 203-214. 74. Homogeneously n_traceable graphs. (with L. Lesniak-Foster and C. E. Wall) Ars Combin. 12 (1981) 311-317. 75. Graphs with prescribed degree sets and girth. (with R. J. Gould and S. F. Kapoor) Period. Math. Hungar. 12 (1981) 261-266. |
1982 |
76. Smallest cubic and quartic graphs with a given number
f cutpoints and bridges.
Internat. J. Math. & Math. Sci.
5 (1982) 41-48.
(with J. K. Cooper, Jr., F.
Harary, F. Saba and C. E. Wall)
77. On randomly 3_axial graphs. Bull. Austral. Math. Soc. 25 (1982) 187-206. (with Y. Alavi, S. S. Anderson and S. F. Kapoor) |
1983 |
78. The traceability of a graph.
(with J. K.
Cooper, Jr., L. Lesniak-Foster and C. E. Wall)
Indian J. Math.
25 (1983) 17-28.
79. Chameleonic cubes. (with R. Tosic and V. Petrovic) Math. Teacher 76 (1983) 23-26. 80. Hamiltonian path graphs. (with S. F. Kapoor and E. A. Nordhaus) J. Graph Theory 7 (1983) 419-427. |
1984 |
81. Near 1-factors in graphs. Proceedings of the
(with S. F. Kapoor, L. Lesniak-Foster
and S. Schuster)
Fourteenth Southeastern
Conference on Combinatorics, Graph Theory and Computing.
Congressus Numerantium.
41 (1984) 131-147.
82. Bridge and cycle degrees of vertices in graphs. (with F. Saba and N. C. Wormald) Internat. J. Math. & Math. Sci. 7 (1984) 351-360. 83. Generalized connectivity in graphs. (with S. F. Kapoor, L. Lesniak and D. R. Lick) Bull. Bombay Math. Colloq. 2 (1984) 1-6. |