1985 |
84. The Petersen graph.
(with R. J. Wilson) Graphs and Applications.
Wiley, New York (1985) 69-100. 85. Edge rotations and distance between graphs. (with F. Saba and H. B. Zou) Casopis Pro Pest. Mat. 110 (1985) 87-91. 86. Randomly n-cyclic digraphs. (with O. R. Oellermann and S. Ruiz) Graphs and Combinatorics 1 (1985) 29-40. 87. On the regulation number of a multigraph. (with F. Harary and O. R. Oellermann) Graphs and Combinatorics 1 (1985) 137-144. 88. The partial complement of a graph. (with S. F. Kapoor, D. R. Lick and S. Schuster) Period. Math. Hungar. 16 (1985) 83-95. 89. Some applications of graph theory. (with O. R. Oellermann) Bull. Bombay Math. Colloq. 2 (1985) 55-78. |
1986 |
90. Randomly H graphs.
(with O. R.
Oellermann and S. Ruiz) Math. Slovaca
36 (1986) 129-136. 91. The uniformity number of a graph. (with O. R. Oellermann, F. Saba and H. B. Zou) Indian J. Math. 28 (1986) 1-7. 92. Smallest regular graphs without near 1-factors. (with S. Ruiz and C. E. Wall) J. Austral. Math. Soc. 41 (1986) 193-210. 93. Bipartite regulation numbers. (with Y. Alavi, L. Lesniak and O. R. Oellermann) Discrete Math. 62 (1986) 113-118. 94. Connected graphs containing a given connected graph as a unique greatest common subgraph. (with M. Johnson and O. R. Oellermann) Aequationes Math. 31 (1986) 213-222. |
1987 |
95. Greatest common subgraphs of a graph.
(with F. Saba and H. B. Zou) Casopis Pro Pest. Mat.
112 (1987) 80-88.
96. Highly irregular graphs. (with Y. Alavi, F. R. K. Chung, P. Erd, and O. R. Oellermann) J. Graph Theory 11 (1987) 235-249. 97. F-Degrees in graphs. (with K. S. Holbert, O. R. Oellermann and H. C. Swart) Ars Combinatoria 24 (1987) 133-148. 98. On maximum matchings in cubic graphs with a bounded number of bridge- covering paths. (with S. F. Kapoor, O. R. Oellermann and S. Ruiz) Bull. Austral. Math. Soc. 36 (1987) 441-447. 99. The ascending subgraph decomposition problem. (with Y. Alavi, A. J. Boals, P. Erd and O. R. Oellermann) Congressus Numerantium 58 (1987) 7-14. |
1988 |
100. How to define an irregular graph.
(with P.
Erd, and O. R. Oellermann)
College Math. J. 1 9
(1988) 36-42.
101. Variations on a theorem of Petersen. (with K. S. Bagga, L. W. Beineke and O. R. Oellermann) Period. Math. Hungar. 19 (1988) 241 - 247. 102. Degree representative trees in graphs. (with O. R. Oellermann and H. C. Swart) Proceedings of the 250th Anniversary Conference onGraph Theory . Congressus Numerantium 64 (1988) 73-79. 103. Irregular networks. (with M. S. Jacobson, J. Lehel, O. R. Oellermann, S. Ruiz and F. Saba) Proceedings of the 250th Anniversary of Graph Theory Conference. Congressus Numerantium 64 (1988) 197-210. 104. k_Path irregular graphs. (with Y. Alavi, A. J. Boals, P. Erd and O. R. Oellermann) Congressus Numerantium 65 (1988) 201-210. 105. Trees and greatest common subgraphs. (with H. B. Zou) Scientia. 1 (1988) 33-39. |
1989 |
106. On the edge independence number of a
regular graph with large edge
connectivity.
(with I. Broere, O. R.
Oellermann and C. E. Wall)
Combinatorial Mathematics: Proceedings
of the Third International Conference.
555 (1989) 94-102.
107. Degree uniform graphs. (with L. Lesniak, C. M. Mynhardt and O. R. Oellermann) Combinatorial Mathematics: Proceedings of the Third International Conference. 555 (1989) 122-132. 108. Greatest common subgraphs with specified properties. (with O. R. Oellermann, F. Saba and H. B. Zou) Graphs and Combinatorics. 5 (1989) 1-14. 109. The mean integrity of a graph. (with S. F. Kapoor, T. A. McKee and O. R. Oellermann) Recent Studies in Graph Theory (ed. V. R. Kulli) Vishwa International Publications, Gulbarga, India (1989) 70-80. 110. A matter of degree. (with H. Hevia, O. R. Oellermann, F. Saba and A. J. Schwenk) SIAM J. Discrete Math. 2 (1989) 456_466. 111. Highly regular graphs. (with Y. Alavi, D. R. Lick and H. C. Swart) Graph Theory and Its Applications: East and West 576 (1989) 20-29. 112. Steiner distance in graphs. (with O. R. Oellermann, S. Tian and H. B. Zou) Ocasopis Pro Pest. Mat. 114 (1989) 399-410. |