1990 |
113. Least common supergraphs of graphs.
(with H. Hevia, G. Kubicki,
O. R. Oellermann, F. Saba and H. B.
Zou)
Congressus Numerantium 72 (1990)
109114. 114. Which graphs are distance graphs? (with W. D. Goddard, M. Henning, L. Lesniak, H. C. Swart and C. E. Wall) Ars Combinatoria 29A (1990) 225-232. 115. On peripheral vertices in graphs. (with G. L. Johns and O. R. Oellermann) Topics in Combinatorics and Graph Theory Physica-Verlag, Heidelberg, Germany (1990) 194-199. 116. The theory and applications of greatest common subgraphs. (with G. Kubicki, M. A. Johnson and O. R. Oellermann) Contemporary Methods in Graph Theory, Wissenschaftsverlag, Mannheim (1990) 621-638. 117. Planarity of double-rotation graphs. (with H. Hevia and E. B. Jarrett) Congressus Numerantium 76 (1990) 183-192. |
1991 |
118. Absorbing common subgraphs.
(with P. Erdand G.
Kubicki)Graph Theory, Combinatorics, Algorithms and
Applications.
(eds. Y. Alavi, F. R. K. Chung, R. L. Graham, and D. F. Hsu)
SIAM Publications, Philadelphia
(1991) 96-105.
119. Subgraph distance and generalized line graphs. (with H. Hevia, E. B. Jarrett, F. Saba and D.W.VanderJagt) Graph Theory, Combinatorics, Algorithms and Applications. (eds. Y. Alavi, F. R. K. Chung, R. L. Graham, and D. F. Hsu) SIAM Publications, Philadelphia (1991) 266-280. 120. Distance: A graphical tour. (with O. R. Oellermann and M. Schultz) Graph Theory, Combinatorics, Algorithms and Applications. (eds. Y. Alavi, F. R. K. Chung, R. L. Graham, and D. F. Hsu) SIAM Publications, Philadelphia (1991) 441_458. 121. Maximum distance in digraphs. (with S. Tian) Graph Theory, Combinatorics, Algorithms and Applications. (eds. Y. Alavi, F. R. K. Chung, R. L. Graham, and D. F. Hsu) SIAM Publications, Philadelphia (1991) 525-538. 122. Edge_clique graphs. (with S. F. Kapoor, T. A. McKee and F. Saba) Graphs and Combinatorics. 7 (1991) 253-264 123. Oriented graphs with prescribed m-center and m-median. (with S. Tian) Czech. Math. J. 41 (1991) 716_723. 124. Frank Harary: The ambassador of graph theory. Journal of Combinatorics, Information & System Sciences. 16 (1991) 1-6. 125. Subgraph distance in graphs. (with K. S. Holbert, G. L. Johns and O. R. Oellermann) Journal of Combinatorics, Information & System Sciences. 16 (1991) 67-85 126. On rotation numbers for digraphs. (with R. J. Gould, E. Kubicka, and G. Kubicki) Advances in Graph Theory. (ed. V. R. Kulli) Vishwa International Publications, Gulbarga, India. (1991) 103-119. 127. Planarity of n-subgraph distance graphs. (with H. Hevia, E. B. Jarrett, and D. W. VanderJagt) Advances in Graph Theory. (ed. V. R. Kulli) Vishwa International Publications, Gulbarga, India. (1991) 121-131. |
1992 |
128.Framed! A graph embedding problem.
(with H. J. Gavlas and M. Schultz)
Bulletin of the Institute of
Combinatorics and Its Applications. 4
(1992) 35-50.
129. The ubiquitous Petersen graph. (with H. Hevia and R. J. Wilson) Discrete Math. 100 (1992) 303-311. 130. On signed graphs with prescribed positive and negative graphs. (with F. Harary, H. Hevia and K. McKeon) Vishwa Int. J. Graph Theory. 1 (1992) 9-18. 131. Directed distance in digraphs: centers and peripheries. (with G. L. Johns and S. Tian) Congr. Numer. 89 (1992) 89-95. |
1993 |
132. Detour distance in graphs.
(with G. L. Johns and S. Tian) Quo Vadis,
Graph Theory? Ann. Discrete Math. 55
(1993) 127-136.
133. Principal common divisors of graphs. (with W. Goddard, M. A. Henning, F. Saba, and H. C. Swart Europ. J. Combinatorics. 14 (1993) 85- 93. ) 134. A representation of chemical transformations by labeled graphs. (with H. Hevia and M. A. Johnson) J. Math. Chemistry. 12 (1993) 59-80. 135. Transformations, distance, and distance graphs. (with E. B. Jarrett) Congr. Numer. 92 (1993) 225-241. 136. Directed distance in digraphs: centers and medians. (with G. L. Johns, S. Tian, and S. J. Winters) J. Graph Theory. 17 (1993)509-521. 137. Greatest common divisors and least common multiples of graphs. (with L. Holley, G. Kubicki and M. Schultz) Period. Math. Hungar. 27 (1993) 95-104. 138. A generalized Steiner distance for graphs. (with S. Tian) Journal of Combinatorial Mathematics and Combinatorial Computing. 14 (1993) 137_144. |
1994 |
139. The induced path number of bipartite graphs.
(with J. McCanna, N. Sherwani, J. Hashmi,
and M. Hossain)
Ars Combin. 37 (1994) 191-208.
140. Forced orientation numbers of a graph. (with F. Harary, M. Schultz, and C. E. Wall) Congr. Numer. 100 (1994) 183-191. 141. H-Distance in graphs. (with H. J. Gavlas and M. Schultz) Congr. Numer. 101 (1994) 3-15. 142. The interior and the annulus of a graph. (with G. L. Johns, S. Tian, and S. J. Winters) Congr. Numer. 102 (1994) 57-62. 143. On signed degrees in signed graphs. (with H. Gavlas, F. Harary, and M. Schultz) Czech. Math. J. 44 (1994) 677-690. 144. Prime graphs, prime-connected graphs, and prime divisors of graphs. (with C. M. Mynhardt and F. Saba) Utilitas Math. 46 (1994) 179-191. |