| TBA |
176.
On the nonplanarity of powers of paths
(with G. Chartrand and F. Okamoto).
Util. Math. Accepted. 175. Rainbow trees in graphs and generalized connectivity (with G. Chartrand and F. Okamoto) Networks. Accepted. 174. The tree connectivity of regular complete bipartite graphs (with F. Okamoto) J. Combin. Math. Combin. Comput. Accepted. 173. On multiset colorings of graphs (with E. Salehi, and F. Okamoto) Discuss. Math. Graph Theory Accepted. 172. Neighbor-distinguishing vertex colorings of graphs (with G. Chartrand and F. Okamoto) J. Combin. Math. Combin. Comput. Accepted. 171. On Hamiltonian labelings of graphs (with W. Renzema) J. Combin. Math. Combin. Comput. Accepted. 170. A checkerboard problem and modular colorings of graphs (with E. Salehi, and F. Okamoto) Bull. Inst. Combin Appl. Accepted. 169. The set chromatic number of a graph (with G. Chartrand, C. W. Rasmussen, and F. Okamoto) Discuss. Math. Graph Theory Accepted. 168. The total traceable number of a graph (with F. Okamoto). Util. Math. Accepted. 167. A four colorings theorem (with G. Chartrand, S. T. Hedetniemi, and F. Okamoto). Ars Combin. Accepted. 166. A note on graphs with prescribed complete coloring numbers (with G. Chartrand, F. Okamoto, and Z. Tuza) J. Combin. Math. Combin. Comput. Accepted. 165. Proof of a conjecture on a neighborhood condition for 2-connected claw-free graphs (with K. Zhao and Y. Lin) Comput. Appl. Math. Accepted. 164. The rainbow connectivities of small cubic graphs (with G. L. Johns and F. Okamoto) Ars Combin. Accepted. 163. The gamma-spectrum of a graph (with C. M. da Fonseca and V. Saenpholphat) Ars Combin. Accepted. 162. On local metric dimensions of graphs (with F. Okamoto and B. Phinezy) J. Combin. Math. Combin. Comput. (2010). |
| 2009 |
161.
Set vertex colorings and joins of graphs
(with F. Okamoto and C. W. Rasmussen)
Czechoslovak Math. J. 59 (2009) 929-941. 160. A survey of stratification and domination in graphs (with T. Haynes and M. Henning) Discrete Math. 309 (2009) 5803-5805. 159. A dedication to Professor Gary Chartrand (with T. Haynes and M. Henning) Discrete Math. 309 (2009) 5806-5819. 158. The Rainbow connectivity of a graph (with G. Chartrand, G. L. Johns, and K. A. McKeon) Networks 1002 (2009) 75-81. 157. A note on graphs with prescribed order and rainbow index (with F. Okamoto) Congr. Numer. (2009). 156. Results and open problems on Hamiltonian labelings of graphs (with F. Okamoto and W. Renzema) Congr. Numer.. (2009). 155. On modular colorings of caterpillars (with E. Salehi and F. Okamoto) Congr. Numer. (2009). 154. Detour antipodal graphs (with G. L. Johns and F. Okamoto) J. Combin. Math. Combin. Comput. 70 (2009) 65-83. 153. The multiset chromatic number of a graph (with G. Chartrand, E. Salehi, and F. Okamoto) Math. Bohem. 134 (2009) 191-209. 152. A sufficient condition for pancyclic graphs (with K. Zhao and Y. Lin) Information Processing Letters 109 (2009) 991-996. 151. The metric chromatic number of a graph (with G. Chartrand and F. Okamoto) Australas. J. Combin. 44 (2009) 273-286. 150. Hamiltonian labelings of graphs (with W. Renzema) Involve. 2 (2009) 95-114. |
| 2008 |
149.
On upper traceable numbers of graphs (with F. Okamoto)
Math. Bohem.
133 (2008) 389-405. 148. Neighborhood-rainbow colorings of graphs (with F. Okamoto and B. Phinezy) Congr. Numer. 192 (2008) 5-18. 147. On Hamiltonian colorings and hc-stable graphs (with B. M. Allgeier, G. Chartrand, A. S. Jobson, and L. Nebesky). Congr. Numer. 189 (2008) 65-76. 146. Degree with neighborhood conditions and highly Hamiltonian graphs (with K. Zhao and L. Yue) Acta Appl. Math. 10.1007/s10440-008-9328-x (2008). 145. The upper traceable number of a graph (with F. Okamoto and V. Saenpholphat) Czechoslovak Math. J. 58 (2008) 271-287. 144. Rainbow connection in graphs (with G. Chartrand, G. L. Johns, and K. A. McKeon) Math. Bohem. 133 (2008) 85-98. 143. Recognizable colorings of graphs (with G. Chartrand, L. Lesniak, and D. W. VanderJagt) Discuss. Math. Graph Theory 28 (2008) 35-57. 142. Extremal problems on detectable colorings of trees (with H. Escuadro) Discrete Math. 308 (2008) 1951-1961. 141. A three-color problem in graph theory (with H. Escuadro and F. Okamoto) Bull. Inst. Combin Appl. 52 (2008) 65-82. |
| 2007 |
140.
Radio colorings in graphs - a survey (with
G. Chartrand)
International Journal of
Computational and Applied Mathematics
2 (2007) 237-252. 139. Vertex-distinguishing colorings of graphs -- A survey of recent developments (with H. Escuadro and F. Okamoto) AKCE J. of Graphs Combin. 4 (2007) 277-299. 138. Distance defined by spanning trees in graphs (with G. Chartrand and L. Nebesky) Discuss. Math. Graph Theory 3 (2007) 485-506. 137. On gamma-labelings of oriented graphs (with V. Saenpholphat and F. Okamoto). Math. Bohem. 132 (2007) 185-203. 136. Graphs with prescribed traceable number and related parameters (with F. Okamoto) Congr. Numer. 188 (2007) 11-32. 135. On detectable factorizations of regular graphs (with H. Escuadro and F. Okamoto) Congr. Numer. 185 (2007) 175-186. 134. Rainbow connectivity of cages (with G. Chartrand, G. L. Johns, and K. A. McKeon) Congr. Numer. 184 (2007) 209-222. 133. Stratified domination in oriented graphs (with R. Gera) J. Combin. Math. Combin. Comput. 60 (2007) 105-125. 132. Irregular colorings of graphs (with M. Radcliffe) Bull. Inst. Combin Appl. 49 (2007) 41-59. |
| 2006 |
131. On irregular colorings of graphs
(with M. Radcliffe)
AKCE J. of Graphs Combin. 3
(2006) 175-191. 130. On the irregular chromatic number of a graph (with F. Okamoto and and M. Radcliffe) Congr. Numer. 181 (2006) 129-150. 129. A characterization of graphs whose Hamiltonian and upper Hamiltonian numbers differ by 1 (with F. Okamoto) Congr. Numer. 180 (2006) 129-144. 128. Circulants and a three-color conjecture (with H. Escuadro and F. Okamoto) Congr. Numer. 178 (2006) 33-55. 127. On stratification and domination in graphs (with R. Gera) Discuss. Math. Graph Theory. 26 (2006) 249-272. 126. Uniformly cordial graphs (with G. Chartrand and S. M. Lee). Discrete Math. 306 (2006) 726-737. 125. Measures of traceability in graphs (with V. Saenpholphat and F. Okamoto). Math. Bohem. 131 (2006) 63-83. 124. On detectable factorizations of cubic graphs (with H. Escuadro and F. Okamoto) J. Combin. Math. Combin. Comput. 56 (2006) 47-63. 123. Detectable colorings of graphs (with G. Chartrand, H. Escuadro, and F. Okamoto). Util. Math. 69 (2006) 13-32. |
| 2005 |
122. Extremal problems on detectable colorings
of connected graphs with cycle rank 2.
(with H. Escuadro)
AKCE J. of Graphs Combin. 2 (2005) 99-117. 121. On induced subdigraphs of certain distance-defined digraphs (with R. C. Brigham, G. Chartrand, and R. D. Dutton). Util. Math. 68 (2005) 239-253. 120. On detectable colorings of graphs (with H. Escuadro) Math. Bohem. 130 (2005) 427-445. 119. Graphs with prescribed order and Hamiltonian number (with V. Saenpholphat). Congr. Numer. 175 (2005) 161-173. 118. On stratified domination in oriented graphs (with R. Gera) Congr. Numer. 173 (2005) 175-192. 117. On gamma-labelings of trees (with G. Chartrand, D. Erwin, and D. VanderJagt) Discuss. Math. Graph Theory 25 (2005) 363-383. 116. Realizable triples for stratified domination in graphs (with R. Gera) Math. Bohem. 130 (2005) 185-202. 115. Detour distance in graphs (with G. Chartrand and H. Escuadro). J. Combin. Math. Combin. Comput. 53 (2005) 75-94. 114. Local colorings of graphs. (with G. Chartrand, F. Saba, and E. Salehi). Util. Math. 67 (2005) 107-120. 113. Gamma-labelings of graphs (with G. Chartrand, D. Erwin, and D. VanderJagt) Bull. Inst. Combin Appl. 44 (2005) 51-68. 112. On the dimension of trees (with R. C. Brigham, G. Chartrand, and R. D. Dutton) Discrete Math. 294 (2005) 279-283. 111. Homogeneously embedding stratified graphs in stratified graphs. (with G. Chartrand and D. VanderJagt). Math. Bohem. 130 (2005) 35-48. 110. On hamiltonian colorings of graphs (with G. Chartrand and L. Nebesky) Discrete Math.290 (2005) 133-143. 109. Resolving edge colorings in graphs. (with G. Chartrand and V. Saenpholphat). Ars Combin. 74 (2005) 33-47. 108. A graph labeling problem suggested by FM channel restrictions. (with G. Chartrand and D. Erwin) Bull. Inst. Combin Appl. 43 (2005) 43-57. 107. Hamiltonian colorings of graphs (with G. Chartrand and L. Nebesky) Discrete Appl. Math. 146 (2005) 257-272. |
| 2004 |
106. Homogeneously embeddings of
stratified 5-cycles.
(with G. Chartrand and D. VanderJagt)
Congr. Numer. 170 (2004) 205-222. 105. Detour resolvability in graphs. (with V. Saenpholphat) Congr. Numer. 169 (2004) 3-21. 104. A survey of Hamiltonian colorings of graphs. (with G. Chartrand and L. Nebesky) Congr. Numer. 169 (2004) 179-192. 103. Extremal problems on distances in graphs. (with G. Chartrand and H. Escuadro). Congr. Numer. 167 (2004) 133-147. 102. Bounds for the F-domination number of a graph. (with Ralucca Gera) Congr. Numer. 166 (2004) 131-144. 101. On connected resolving decompositions in graphs. (with V. Saenpholphat). Czechoslovak Math. J. 54 (2004) 681-696. 100. Hamiltonian domination in graphs. (with G. Chartrand, T. W. Haynes, and M. A. Henning). Util. Math. 66 (2004) 33-45. 99. Conditional resolvability in graphs: A Survey (with V. Saenpholphat). Internat. J. Math. Math. Sci. 38 (2004) 98. A new look at Hamiltonian walks. (with G. Chartrand, T. Thomas, and V. Saenpholphat) Bull. Inst. Combin Appl. 42 (2004) 37-52. 97. Distance in graphs - Taking the long view (with G. Chartrand). AKCE J. of Graphs Combin. 1 (2004) 1-13. 96. On the detour number and geodetic number of a graph. (with G. Chartrand and G. L. Johns) Ars Combin. 72 (2004) 3-15. 95. Forcing full domination in graphs. (with R. C. Brigham, G. Chartrand, and R. D. Dutton) J. Combin. Math. Combin. Comput. 49 (2004) 97-111. 94. Detour domination in graphs. (with G. Chartrand, T. W. Haynes, and M. A. Henning) Ars Combin. 71 (2004) 149-160. 93. On resolving acyclic partitions of graphs. (with V. Saenpholphat). Ars Combin. 71 (2004) 65-78. 92. On boundary vertices in graphs. (with G. Chartrand, D. Erwin, and G. L. Johns) J. Combin. Math. Combin. Comput. 48 (2004) 39-53. 91. Resolving acyclic partitions of graphs. (with V. Saenpholphat). Ars Combin. 70 (2004) 61-74. 90. Radio k-colorings of paths (with G. Chartrand and L. Nebesky). Discuss. Math. Graph Theory 24 (2004) 5-21. |
| 2003 |
89.
The independent resolving number of a graph.
(with G. Chartrand and V. Saenpholphat).
Math. Bohem.
128 (2003) 379-393. 88. Connected resolvability of graphs (with V. Saenpholphat) Czechoslovak Math. J. 53 (2003) 827-841. 87. The detour number of a graph. (with G. Chartrand, and G. L. Johns) Util. Math. 64 (2003) 97-113. 86. On resolving edge colorings in graphs. (with V. Saenpholphat). Internat. J. Math. Math. Sci. 46 (2003) 2947-2959. 85. Stratification and domination in graphs. (with G. Chartrand, T. W. Haynes, and M. A. Henning). Discrete Math. 272 (2003) 171-185 84. Greedy F-colorings of of graphs (with G. Chartrand and L. Nebesky). Discrete Math. 272 (2003) 37-46. 83. Divisor graphs with triangles. (with V. Saenpholphat and R. Gera) Congr. Numer. 160-165 (2003) 82. Orientable hull numbers of a graph. (with G. Chartrand and J. F. Fink) Congr. Numer. 160-165 (2003) 81. On the Hamiltonian number of a graph. (with G. Chartrand, T. Thomas, and V. Saenpholphat) Congr. Numer. 160-165 (2003) 80. On local colorings of graphs. (with G. Chartrand and E. Salehi) Congr. Numer. 160-165 (2003) 79. The theory and applications of resolvability in graphs: A survey. (with G. Chartrand) Congr. Numer. 160-165 (2003) 78. On connected resolvability of graphs (with V. Saenpholphat). Australas. J. Combin. 28 (2003) 25-37. 77. Connected resolving sets in graphs. (with V. Saenpholphat). Ars Combin. 68 (2003) 3-16 76. Nonplanar sequences of iterated r-jump graphs. (with G. Chartrand). Ars Combin. 68 (2003) 77-86 75. The hull number of an oriented graph (with G. Chartrand and J. F. Fink). Internat. J. Math. Math. Sci. 36 (2003) 2265-2275 74. Connected resolving decompositions in graphs (with V. Saenpholphat). Math. Bohem. 128 (2003) 121-136. 73. A note on nonplanar sequences of iterated jump graphs. J. Combin. Math. Combin. Comput. 45 (2003) 21-32. 72. Graphs of order n with locating-chromatic number n-1. (with Chartrand, Erwin, Henning, and Slater). Discrete Math. 269 (2003) 65-79. 71. Distance-locating numbers of graphs. (with G. Chartrand, D. Erwin, and P. J. Slater). Util. Math. 63 (2003) 65-79. 70. Resolving domination in graphs. (with R. C. Brigham, G. Chartrand, and R. D. Dutton). Math. Bohem. 128 (2003) 25-36. 69. On k-dimensional graphs and their bases (with G. Chartrand, P. Buczkowski, and C. Poisson) Period. Math. Hungar. 46 (2003) 9-15. 68. Boundary vertices in graphs. (with G. Chartrand, D. Erwin, and G. L. Johns). Discrete Math. 263 (2003) 25--34. |
| 2002 |
67. Extreme geodesic graphs
(with G. Chartrand)
Czechoslovak Math. J. 52 (2002) 771-780. 66. On k-strong distance in strong digraphs. Math. Bohem. 127 (2002) 557-570. 65. Radio labelings of cycles Ars Combin. 65 (2002) 21-32. 64. Connected partition dimensions of graphs. (with V. Saenpholphat). DiscusMath. Graph Theory 22 (2002) 305-323. 63. The locating-chromatic number of a graph. (with G. Chartrand, D. Erwin, M. A. Henning, and P. J. Slater) Bull.Inst. Combin. Appl. 36 (2002) 89-101 62. Some results on connected resolvability in graphs (with V. Saenpholphat). Congr. Numer. 158 (2002) 5-19. 61. On k-geodomination in Cartesian products. (with R. Gera). Congr. Numer. 158 163-178. (2002) 60. Isometric embeddings of bipartite graphs. (with R. C. Brigham, G. Chartrand, and R. D. Dutton). Congr. Numer. 154 (2002) 7-12. 59. Bounds for the hamiltonian chromatic number of a graph. (with G. Chartrand and L. Nebesky) Congr. Numer. 157 (2002) 113-125. 58. The geodetic number of a graph: A survey. (with G. Chartrand and E. M. Palmer) Congr. Numer. 156 (2002) 37-58. 57. The convexity number of a graph (with G. Chartrand, and C.Wall) Graphs and Combin. 18 (2002) 209-217. 56. k-Geodomination in graphs (with R. Muntean) Ars Combin. 63 (2002) 33--47. 55. The metric dimension of unicyclic graphs (with C. Poisson). J. Combin. Math. Combin. Comput. 40 (2002) 17 - 32. 54. Radio antipodal colorings of graphs (with G. Chartrand, and D. Erwin) Math. Bohem. 127 (2002) 57-69. 53. The upper forcing geodetic number of a graph. Ars Combin. 62 (2002) 3-15. 52. Convexity in oriented graphs (G. Chartrand and J. F. Fink) Discrete Appl. Math. 117 (2002) 115-126. 51. The Steiner number of a graph (with G. Chartrand) Discrete Math. 242 (2002) 41-54. 50. On the geodetic number of a graph (with G. Chartrand and F. Harary). Networks. 39 (2002) 1-6 |
| 2001 |
49. The decomposition dimension of graphs
(with G. Chartrand, D.
Erwin, and M. Raines).
Graphs and Combin. 17 (2001) 599-605
48. The forcing convexity number of a graph (with G. Chartrand) Czechoslovak Math. J. 51 (2001) 847--858. 47. On the dimension of oriented graphs (with G. Chartrand and M. Raines). Util. Math. 60 (2001) 139-151. 46. The forcing dimension of a graph. (with G. Chartrand) Math. Bohem. 126 (2001) 711-720 45. Radio labelings of graphs (with G. Chartrand, D. Erwin, and F. Harary) Bull. Inst. Combin Appl. 33 (2001) 77-85 44. Full domination in graphs (with R. C. Brigham, G. Chartrand and R. D. Dutton). Discuss. Math. Graph Theory. 21 (2001) 43-62 43. On graphs with a unique minimum hull set (with G. Chartrand). Discuss. Math. Graph Theory 21 (2001) 31-42. 42. On graphs with prescribed full domination numbers. (with R. C. Brigham, G. Chartrand, and R. D. Dutton). Congr. Numer. 149 (2001) 5-17. 41. Which graphs are divisor graphs? (with G. Chartrand, R. Muntean, and V. Saenpholphat) Congr. Numer. 151 (2001) 189-200. 40. The forcing cr-number of a graph. (with V. Saenpholphat). Congr. Numer. 152 (2001) 93-103. 39. On convexity in graphs. (with G. Chartrand, A. Chichisan, and C. E. Wall). Congr. Numer. 148 (2001) 33-41. 38. F-Continuous graphs (with G. Chartrand, E. B. Jarrett, F. Saba, and E. Salehi). Czechoslovak Math. J. 51 (2001) 351-361. 37. An introduction to analytic graph theory (with G. Chartrand, L. Eroh, and M. Schultz). Util. Math. 59 (2001) 31-55 36. H-convex graphs (with G. Chartrand) Math. Bohem. 126 (2001) 209-220 35. Iterated homology and decompositions of simplicial complexes (with A. Duval). Israel J. Math. 121 (2001) 313-331 34. The forcing hull number of a graph (with G. Chartrand). J. Combin. Math. Combin. Comput. 38 (2001) 81-94 33. Degree-continuous graphs (with J. Gimbel). Czechoslovak Math. J. 51 (126) (2001) 163-171 32. Orientation Distance graphs (with G. Chartrand, D. Erwin, and M. Raines). J. Graph Theory. 36 (2001) 230-241. 31. Geodomination in graphs (with G. Chartrand, F. Harary, and H. Swart). Bull. Inst. Combin. Appl. 31 (2001) 51-59. 30. On the planarity of iterated jump graphs (with G. Chartrand and D. W. VanderJagt). Discrete Math. 226 (2001) 93-106. |
| 2000 |
29.
Algebraic and combinatorial ways of computing the Mobius
function and the characteristic
polynomial of truncated Boolean algebras.
Scientia 6 (1994-2000) 129-141. 28. On the hull number of a graph (with G. Chartrand and F. Harary). Ars Combin. 57 (2000) 129-138. 27. The characteristic polynomials of interpolations between Coxeter arrangements J. Combin. Math. Combin. Comput. 34 (2000) 109-117 26. On the chromatic dimension of a graph (with G. Chartrand) Congr. Numer. 145 (2000) 97-108. 25. Radio antipodal colorings of cycles (with G. Chartrand and D. Erwin) Congr. Numer. 144 (2000) 129-141. 24. On geodomination in graphs (with R. Muntean) Congr. Numer. 143 (2000) 161-174. 23. Stratified claw domination in prisms (with G. Chartrand, T. W. Haynes, and M. A. Henning ). J. Combin. Math. Combin. Comput. 30 (2000) 81-96. 22. Geodetic sets in graphs (with G. Chartrand and F. Harary). Discuss. Math. Graph Theory 20 No. 1 (2000) 129-138 . 21. Resolvability and the upper dimension of graphs (with G. Chartrand and C. Poisson). International J. Comput. Math. Appl. 39 (2000) 19-28. 20. On the planarity of jump graphs (with H. Hevia and D. W. VanderJagt) Discrete Math. 220 (2000) 119-129. 19. The directed distance dimension of oriented graphs (with G. Chartrand and M. E. Raines) Math. Bohem. 125 (2000) 155-168. 18. How large can the domination numbers of a graph be? (with G. Chartrand, L. Eroh, and F. Harary). Australas. J. Combin. 21 (2000) 23-35 17. The partition dimension of a graph (with G. Chartrand and E. Salehi). Aequationes Math. 59 (2000) 45-54. 16. The geodetic number of an oriented graph (with G. Chartrand). European J. Combin. 21 N0. 2 (2000) 181-189. |
| 1999 |
15. On strong distance in strong
oriented graphs (with G.
Chartrand, D. Erwin, and M. Raines)
Congr. Numer. 141 (1999) 49-63. 14. Steiner sets in graphs. Congr. Numer. 136 (1999) 141-155. 13. Which sequences of iterated jump graphs are planar? (with G. Chartrand, H. Gavlas, and D. W. VanderJagt) Congr. Numer. 139(1999) 33-39. 12. Convex sets in graphs (with G. Chartrand) Congr. Numer. 136 (1999) 19-32. 11. Strong distance in strong digraphs (with G. Chartrand, D. Erwin, and M. Raines) J. Combin. Math. Combin. Comput. 31 (1999) 33-44. 10. The Steiner distance dimension of graphs (with M. Raines). Australas. J. Combin. 20 (1999) 133-143. 9. Realizable ratios in graph theory: geodesic parameters. (with G.Chartrand). Bull. Inst. Combin. Appl. 27 (1999) 69-80. 8. The forcing geodetic number of a graph (with G. Chartrand). Discuss. Math. Graph Theory 19 (1999) 45-58. |
| 1998 |
7. On the partition dimension of a graph
(with G. Chartrand and E.Salehi).
Congr. Numer. 131 (1998)
55-66. 6. Extremal problems in geodetic graph theory (with G. Chartrand and F. Harary). Congr. Numer. 130 (1998) 157-168. 5. Starfree biclique decompositions of complete graphs (with A.Schwenk). Bull. Inst. Combin. Appl. 23 (1998) 33-62. |
| 1997 |
4. Truncated Boolean algebras as subspace
arrangements.
Congr. Numer. 128
(1997) 121-127. 3. The characteristic polynomials of subarrangements of Coxeter arrangements. Discrete Math. 177(1-3) (1997) 245-248. 2. Arithmetic properties of generalized Euler numbers (with B. Sagan). Southeast Asian Bulletin of Mathematics 21 (1997) 73-78. |
| 1996 |
1. The Wiener polynomial of a graph (with B.
Sagan and Y.-N. Yeh).
International Journal of Quantum Chemistry
60
(1996)
959-969. |