TBA |
284. Majestic 2-tone colorings of graphs
(with I. Hart).
Ars Combin. Accepted. 283. Sum-defined colorings in graphs (with J. Hallas and Ian Hart) J. Combin. Math. Combin. Comput. Accepted. 282. On the s-bipartite Ramsey numbers of Graphs K(2,3) and K(3,3) (with Z. Bi and D. Olejniczak). J. Combin. Math. Combin. Comput. Accepted. 281. Rainbow disconnection in graphs (with G. Chartrand, S. Devereaux, T. Haynes and S. Hedetniemi) Discuss. Math. Graph Theory. Accepted. 280. Strong chromatic connectivity of complete bpartite graphs (with E. Laforge). J. Combin. Math. Combin. Comput. Accepted. 279. Color connection in graphs intermediate to proper and rainbow connection (with S. Devereaux and G. L. Johns). J. Combin. Math. Combin. Comput. Accepted. 278. On rainbow Hamiltonian-connected graphs and digraphs (with Z. Bi and A. Byers). J. Combin. Math. Combin. Comput. Accepted. 277. On set-defined colorings of Cartesian products of graphs (with Z. Bi and I. Hart). J. Combin. Math. Combin. Comput. Accepted. 276. Hamiltonian extension in digraphs (with Z. Bi and F. Fujie) J. Combin. Math. Combin. Comput. Accepted. 275. Another view of bipartite Ramsey numbers (with Z. Bi and G. Chartrand) Discuss. Math. Graph Theory. Accepted. 274. Bounds for proper k-connectivity of complete bipartite graphs (with E. Laforge) J. Combin. Math. Combin. Comput. Accepted. 273. Color-connected graphs and information-transfer paths (with G.Chartrand and S. Devereaux) Ars Combin. Accepted. 272. The s-bipartite Ramsey numbers of the graph K(2, 3) (with Z. Bi and D. Olejniczak) Ars Combin. Accepted. 271. A new view of bipartite Ramsey numbers (with Z. Bi and G. Chartrand) J. Combin. Math. Combin. Comput. Accepted. 270. Kaleidoscopic colorings of graphs (with G. Chartrand and S. English) Discuss. Math. Graph Theory. Accepted. 269. Revisiting graceful labelings of graphs (with Z. Bi and A. Byers) J. Combin. Math. Combin. Comput. Accepted. 268. Changing views of Ramsey numbers (with D. Olejniczak) J. Combin. Math. Combin. Comput. Accepted. 267. On k-Ramsey numbers of stripes (with E. Andrews, Z. Bi, D. Johnston and C. Lumduanhom) Util. Math. Accepted. 266. Majestic colorings of graphs (with Z. Bi, S. English and I. Hart) J. Combin. Math. Combin. Comput. Accepted. 265. From connectivity to coloring (with G. Chartrand, T. W. Haynes and S. T. Hedetniemi) J. Combin. Math. Combin. Comput. Accepted. 264. On Hamiltonian cycle extension in cubic Hamiltonian graphs (with F. Fujie and Z. Bi) J. Combin. Math. Combin. Comput. Accepted. 263. Graceful colorings of graphs (with Z. Bi, A. Byers, S. English and E. Laforge) J. Combin. Math. Combin. Comput. Accepted. 262. Proper Ramsey numbers of graphs (with S. English, D. Johnston and D. Olejniczak) J. Combin. Math. Combin. Comput. Accepted. 261. On sharp lower bounds for panconnected, geodesic-pancyclic and path pancyclic graphs (with Z. Bi) J. Combin. Math. Combin. Comput. Accepted. 260. On k-Ramsey numbers of unicyclic-star graphs (with D. Johnston and C. Lumduanhom) Ars Combin. Accepted. |
2017 |
259. Stars and their k-Ramsey numbers (with E. Andrews, G. Chartrand and C. Lumduanhom)
Graphs Combin.
33 (2017) 257-274. 258. On graceful colorings of trees (with English) Math. Bohemica. 142 (2017) 57-73. 257. Proper Hamiltonian-connected graphs (with Z. Bi and A. Byers) Bull. Inst. Combin Appl. 79 (2017) 31-48. |
2016 |
256. Oriented modular arc colorings in digraphs
(with R. Jones, B. Phinezy and S. Speiss)
Util. Math.
101 (2016) 243-259. 255. Rainbow Hamiltonian-connected graphs (with Z. Bi and A. Byers) Bull. Inst. Combin Appl. 78 (2016) 8-22. 256. A note on the 2-Ramsey numbers of 4-cycles (with D. Johnston) J. Combin. Math. Combin. Comput. 98 (2016) 271-279. 254. Characterizations of highly path-Hamiltonian graphs (with F. Fujie and Z. Bi) J. Combin. Math. Combin. Comput. 98 (2016) 253-270. 253. On L-path-Hamiltonian and L-path-pancyclic graphs (with F. Fujie and Z. Bi) J. Combin. Math. Combin. Comput. 98 (2016) 201-219. 252. Proper-path colorings in graph operations (with E. Andrews, E. Laforge and C. Lumduanhom) J. Combin. Math. Combin. Comput. 98 (2016) 239-252. 251. On color frames of stars and generalized matching numbers (with D. Johnston and C. Lumduanhom) J. Combin. Math. Combin. Comput. 98 (2016) 221-237. 249. On minimum spanning subgraphs of graphs with proper connection number 2 (with Z. Bi, G, Chartrand and G. L. Johns) Theory and Applications of Graphs. Vol 3: Iss. 2, Article 2. (2016) 248. On proper-path colorings in graphs (with E. Andrews, E. Laforge and C. Lumduanhom) J. Combin. Math. Combin. Comput. 97 (2016) 189-207. 247. On an extension of an observation of Hamilton (with G. Chartrand and F. Fujie) J. Combin. Math. Combin. Comput. 96 (2016) 113-128. 246. Hamiltonian Extension. Graph Theory - Favorite Conjectures and Open Problems (ed. by Gera, Hedetniemin and Larson) (2016) 245. Binomial colorings of graphs (with G. Chartrand and S. English) Bull. Inst. Combin Appl. 76 (2016) 69-84. 244. Characterizations of graphs having large proper connection numbers (with E. Laforge and C. Lumduanhom) Discuss. Math. Graph Theory. 36 (2016) 439-453. |
2015 |
243. On characterizations of trees having large (2, 0)-chromatic numbers
(with E. Andrews and C. Lumduanhom)
J. Combin. Math. Combin. Comput.
95 (2015) 161-175. 242. On vertex-distinquishing edge colorings of graphs (with S. English, D. Johnston and E. Laforge) Congr. Numer. 225 (2015) 37-54. 241. Chromatic connection in graphs (with E. Laforge and C. Lumduanhom) Congr. Numer. 225 (2015) 197-209. 240. On a graph theoretic division algorithm and maximal decompositions of graphs (with E. Andrews) J. Combin. Math. Combin. Comput. 94 (2015) 79-95. 239. On monochromatic spectra in graphs (with E. Andrews and C. Lumduanhom) J. Combin. Math. Combin. Comput. 94 (2015) 97-114. 238. On twin edge colorings in trees (with E. Andrews and D. Johnston) J. Combin. Math. Combin. Comput. 94 (2015) 115-131. 237. On Eulerian regular complete 5-partite graphs and a cycle decomposition problem (with E. Andrews and Z. Bi) J. Combin. Math. Combin. Comput. 94 (2015) 61-77. 236. On gamma-labelings of graphs (with C. M. da Fonseca and V. Saenpholphat) Util. Math. 98 (2015) 33-42. 235. On color frames of claws and matchings (with D. Johnston) J. Combin. Math. Combin. Comput. 93 (2015) 83-200. 234. On distance-defined neighbor-distinguishing sets in graphs (with F. Fujie and B. Phinezy) Util. Math. 97 (2015) 85-96. 233. Color-distance in color-connected Graphs (with R. Jones, K. Kolasinski and C. Lumduanhom). Util. Math. 96 (2015) 301-317. 232. On k-path pancyclic graphs (with Z. Bi) Discuss. Math. Graph Theory. 35 (2015) 271-281. 231. On the Eulerian cycle decomposition conjecture and complete multipartite graphs (with E. Andrews, G. Chartrand and H. Jordon) Bull. Inst. Combin Appl. 73 (2015) 23-46. |
2014 |
230. Fan type condition and characterization of Hamiltonian graphs
(with Chao and Song)
Proc. Amer. Math. Soc. 142 (2014) 2303-2311. 229. A note on vertex-covering walks (with F. Fujie) J. Combin. Math. Combin. Comput. 90 (2014) 3-9. 228. From combinatorial problems to graph colorings (with E. Andrews and C. Lumduanhom) J. Combin. Math. Combin. Comput. 90 (2014) 75-95. 227. On Eulerian irregularities of prisms, grids and powers of cycles (with E. Andrews and C. Lumduanhom) J. Combin. Math. Combin. Comput. 90 (2014) 167-184. 226. On twin edge colorings of graphs (with E. Andrews, L. Helenius, D. Johnston and J. VerWys) Discuss. Math. Graph Theory. 34 (2014) 613-627. 225. A graph theoretic division algorithm (with E. Andrews) Util. Math. 94 (2014) 49-65. 224. On modular monochromatic colorings of graphs (with E. Andrews, G. Chartrand and C. Lumduanhom) Util. Math. 94 (2014) 251--268. 223. A princess in the kingdom of domination. (with G. Chartrand and M. A. Henning) Util. Math. 94 (2014) 5-18. 222. A dedication to Teresa W. Haynes. (with G. Chartrand and M. A. Henning) Util. Math. 94 (2014) 3-4. 221. An upper bound for the twin chromatic index of a graph (with D. Johnston) Congr. Numer. 219 (2014) 175-182. 220. On monochromatic frames in graphs (with E. Andrews and C. Lumduanhom) Congr. Numer. 219 (2014) 7-22. 219. From edge colorings to graph decompositions (with Z. Bi) Congr. Numer. 222 (2014) 139-149. 218. On maximal decompositions of graphs (with E. Andrews) Congr. Numer. 222 (2014) 5-20. 217. A twin edge coloring conjecture (with E. Andrews and D. Johnston) Bull. Inst. Combin Appl. 70 (2014) 28-44. 216. On Eulerian irregularity in graphs (with E. Andrews and C. Lumduanhom) Discuss. Math. Graph Theory. 34 (2014) 391-408. 215. A cycle decomposition conjecture for Eulerian graphs (with G. Chartrand and H. Jordon) Australas. J. Combin. 58 (2014) 48-59. 214. On Hamiltonian-colored graphs (with R. Jones and K. Kolasinski) Util. Math. 93 (2014) 79-96. |
2013 |
213. An edge bicoloring view of
edge independence and edge domination
(with D. Johnston and B. Phinezy)
J. Combin. Math. Combin. Comput.
87 (2013) 115-136. 212. On Eulerian walks in graphs (with E. Andrews, G. Chartrand and C. Lumduanhom) Bull. Inst. Combin Appl. 68 (2013) 12-26. 211. Extremal values for a gamma-labeling of a cycle with a triangle (with C. M. da Fonseca and V. Saenpholphat) Util. Math. 92 (2013) 167-185. 210. On irregular Eulerian walks in circulants (with E. Andrews and C. Lumduanhom) Congr. Numer. 217 (2013) 33-52. 209. On total distances of cyclic orderings and Hamiltonian spectrums (with F. Fujie) Congr. Numer. 218 (2013) 21-23. 208. On modular monochromatic (2, 0)-molorings (with E. Andrews and C. Lumduanhom) Congr. Numer. 218 (2013) 157-175. 207. On color frames of claws in graphs (with G. Chartrand and D. Johnston) J. Combin. Math. Combin. Comput. 85 (2013) 13-31. 206. On modular edge-graceful graphs (with R. Jones, K. Kolasinski and F. Okamoto) Graphs Combin. 29 (2013) 901-912. 205. On closed modular colorings of rooted trees (with B. Phinezy) Involve. 6 (2013) 83-97. 204. On properly colored Hamiltonian cycles in cubes of distance-colored grids (with D. Dogan and K. Kolasinski) AKCE J. of Graphs Combin. 10 (2013) 57-67. 203. On closed modular colorings of trees (with B. Phinezy) Discuss. Math. Graph Theory 32 (2013) 411-428. |
2012 |
202. On closed modular colorings of regular graphs
(with G. Chartrand and B. Phinezy)
Bull. Inst. Combin Appl.
66 (2012) 7-32. 201. One sufficient condition for Hamiltonian graphs involving distances (with K. Zhao and Y. Lin) Russian Mathematics (IZ. VUZ) 56 (2012) 38-43. 200. Hamiltonian-colored powers of strong digraphs (with G. Johns, R. Jones and K. Kolasinski) Discuss. Math. Graph Theory 32 (2012) 705-724. 199. On modular and graceful labelings (with R. Jones) Congr. Numer. 214 (2012) 167-178. 198. From puzzles to graphs to colorings (with B. Phinezy) Congr. Numer. 214 (2012) 103-119. 197. Neighbor-distinguishing metric sets -- results and open questions (with F. Fujie-Okamoto and B. Phinezy) Congr. Numer. 211 (2012) 5-22. 196. On the nonplanarity of powers of paths (with G. Chartrand and F. Fujie). Util. Math. 89 (2012) 331-341. 195. Monochromatic-bichromatic Ramsey numbers (with G. Chartrand, F. Fujie and K. Kolasinski) Bull. Inst. Combin Appl. 65 (2012) 72-88. 194. Nowhere-zero modular edge-graceful graphs (with R. Jones) Discuss. Math. Graph Theory 32 (2012) 487-505. 193. On modular chromatic indexes of graphs (with F. Fujie, R. Jones and K. Kolasinski) J. Combin. Math. Combin. Comput. 82 (2012) 295-306. 192. On color-connected graphs (with R. Jones, K. Kolasinski and C.Lumduanhom) J. Combin. Math. Combin. Comput. 82 (2012) 211-228. 191. The k-metric colorings of a graph (with F. Fujie and W. Renzema) Math. Bohem. 137 (2012) 45-63. 190. The rainbow connectivities of small cubic graphs (with F. Fujie and G. L. Johns) Ars Combin. 105 (2012) 129-147. 189. A proof of the modular edge-graceful trees conjecture (with R. Jones and K. Kolasinski) J. Combin. Math. Combin. Comput. 80 (2012) 445-455 188. Vertex rainbow colorings of graphs (with Fujie, Kolasinski and Lin) Discuss. Math. Graph Theory 32 (2012) 61-78. |
2011 |
187. The total traceable number of a graph
(with F. Fujie).
Util. Math. 85 (2011) 13-31. 186. Rainbow subgraphs in distance-colored graphs (with R. Jones and K. Kolasinski) Congr. Numer. 207 (2011) 7-21. 185. Which graphs are modular k-colorable? (with R. Jones and K. Kolasinski) Congr. Numer. (2011) 181-191. 184. Monochromatic-rainbow Ramsey numbers a specified number of colors (with F. Fujie, R. Jones and K. Kolasinski) Congr. Numer. (2011) 87-103. 183. Rainbow trees in small cubic graphs (with Fujie and Lin) J. Combin. Math. Combin. Comput. 78 (2011) 33-47. 182. A four colorings theorem (with G. Chartrand, S. T. Hedetniemi, and F. Okamoto). J. Combin. Math. Combin. Comput. 77 (2011) 75-87. 181. The colored bridges problem (with G. Chartrand and K. Kolasinski) Geographical Analysis. 43 (2011) 370-382. 180. The gamma-spectrum of a graph (with C. M. da Fonseca and V. Saenpholphat) Ars Combin. 101 (2011) 109-127. 179. Modular neighbor-distinguishing edge colorings of graphs (with R. Jones, K. Kolasinski and F. Okamoto) J. Combin. Math. Combin. Comput. 76 (2011) 159-175. 178. Set colorings in perfect graphs (with R. Gera, C. W. Rasmussen, and F. Okamoto). Math. Bohem. 136 (2011) 61-68. |
2010 |
177. The sigma chromatic number of a graph
(with G. Chartrand and F. Okamoto)
Graphs Combin.
26 (2010) 755-773. 176. On Hamiltonian labelings of graphs (with W. Renzema) J. Combin. Math. Combin. Comput. 74 (2010) 143-159. 175. The tree connectivity of regular complete bipartite graphs (with F. Okamoto) J. Combin. Math. Combin. Comput. 74 (2010) 279-293. 174. Neighbor-distinguishing vertex colorings of graphs (with G. Chartrand and F. Okamoto) J. Combin. Math. Combin. Comput. 74 (2010) 223-251. 173. Color-sensitive checkerboards (with R. Jones, K. Kolasinski and F. Okamoto) Congr. Numer. 202 (2010) 195-209. 172. On the Hamiltonicity of distance-colored graphs (with G. Chartrand, R. Jones and K. Kolasinski) Congr. Numer. 202 (2010) 129-136. 171. Rainbow trees in graphs and generalized connectivity (with G. Chartrand and F. Okamoto) Networks. 55 (2010) 360-367. 170. A solution to the checkerboard problem (with E. Salehi and F. Okamoto) Int. J. Comput. Appl. Math. 5 (2010) 447-458. 169. A note on graphs with prescribed complete coloring numbers (with G. Chartrand, F. Okamoto, and Z. Tuza) J. Combin. Math. Combin. Comput. 73 (2010) 77-84. 168. The local metric dimension of a graph (with F. Okamoto and B. Phinezy) Math. Bohem. 135 (2010) 239-255. 167. A note on 2-distance chromatic numbers of graphs (with F. Okamoto) AKCE J. of Graphs Combin. 7 (2010) 5-9. 166. On multiset colorings of graphs (with E. Salehi, and F. Okamoto) Discuss. Math. Graph Theory 30 (2010) 137-153. 165. On local metric dimensions of graphs (with F. Okamoto and B. Phinezy) J. Combin. Math. Combin. Comput. 72 (2010) 243--259. 164. A checkerboard problem and modular colorings of graphs (with E. Salehi, and F. Okamoto) Bull. Inst. Combin Appl. 58 (2010) 29-47. 163. Degree with neighborhood conditions and highly Hamiltonian graphs (with Zhao and Yue) Acta Appl. Math. 109 (2010) 487-493. |
2009 |
162.
The set chromatic number of a graph
(with G. Chartrand, C. W. Rasmussen, and F. Okamoto)
Discuss. Math. Graph Theory 29 (2009) 545-561. 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 54 (2009) 75-81. 157. Results and open problems on Hamiltonian labelings of graphs (with F. Okamoto and W. Renzema) Congr. Numer. 198 (2009) 189-206. 156. On modular colorings of caterpillars (with E. Salehi and F. Okamoto) Congr. Numer. 197 (2009) 213-220. 155. A note on graphs with prescribed order and rainbow index (with F. Okamoto) Congr. Numer. 197 (2009) 121-127. 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 Zhao and Lin) Inform. Process. Lett. 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. The upper traceable number of a graph (with F. Okamoto and V. Saenpholphat) Czechoslovak Math. J. 58 (2008) 271-287. 145. Rainbow connection in graphs (with G. Chartrand, G. L. Johns, and K. A. McKeon) Math. Bohem. 133 (2008) 85-98. 144. Recognizable colorings of graphs (with G. Chartrand, L. Lesniak, and D. W. VanderJagt) Discuss. Math. Graph Theory 28 (2008) 35-57. 143. Extremal problems on detectable colorings of trees (with H. Escuadro) Discrete Math. 308 (2008) 1951-1961. 142. A three-color problem in graph theory (with H. Escuadro and F. Okamoto) Bull. Inst. Combin Appl. 52 (2008) 65-82. |
2007 |
141.
Radio colorings in graphs - a survey (with
G. Chartrand)
J. Comput. Appl. Math.
2 (2007) 237-252. 140. 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. 139. Distance defined by spanning trees in graphs (with G. Chartrand and L. Nebesky) Discuss. Math. Graph Theory 3 (2007) 485-506. 138. On gamma-labelings of oriented graphs (with V. Saenpholphat and F. Okamoto). Math. Bohem. 132 (2007) 185-203. 137. Graphs with prescribed traceable number and related parameters (with F. Okamoto) Congr. Numer. 188 (2007) 11-32. 136. On detectable factorizations of regular graphs (with H. Escuadro and F. Okamoto) Congr. Numer. 185 (2007) 175-186. 135. Rainbow connectivity of cages (with G. Chartrand, G. L. Johns, and K. A. McKeon) Congr. Numer. 184 (2007) 209-222. 134. Stratified domination in oriented graphs (with R. Gera) J. Combin. Math. Combin. Comput. 60 (2007) 105-125. 133. Irregular colorings of graphs (with M. Radcliffe) Bull. Inst. Combin. Appl. 49 (2007) 41-59. |
2006 |
132. On irregular colorings of graphs
(with M. Radcliffe)
AKCE J. of Graphs Combin. 3
(2006) 175-191. 131. On the irregular chromatic number of a graph (with F. Okamoto and and M. Radcliffe) Congr. Numer. 181 (2006) 129-150. 130. A characterization of graphs whose Hamiltonian and upper Hamiltonian numbers differ by 1 (with F. Okamoto) Congr. Numer. 180 (2006) 129-144. 129. Circulants and a three-color conjecture (with H. Escuadro and F. Okamoto) Congr. Numer. 178 (2006) 33-55. 128. On stratification and domination in graphs (with R. Gera) Discuss. Math. Graph Theory. 26 (2006) 249-272. 127. Uniformly cordial graphs (with G. Chartrand and S. M. Lee). Discrete Math. 306 (2006) 726-737. 126. Measures of traceability in graphs (with V. Saenpholphat and F. Okamoto). Math. Bohem. 131 (2006) 63-83. 125. On detectable factorizations of cubic graphs (with H. Escuadro and F. Okamoto) J. Combin. Math. Combin. Comput. 56 (2006) 47-63. 124. Detectable colorings of graphs (with G. Chartrand, H. Escuadro, and F. Okamoto). Util. Math. 69 (2006) 13-32. |
2005 |
123. Extremal problems on detectable colorings
of connected graphs with cycle rank 2.
(with H. Escuadro)
AKCE J. of Graphs Combin. 2 (2005) 99-117. 122. On induced subdigraphs of certain distance-defined digraphs (with R. C. Brigham, G. Chartrand, and R. D. Dutton). Util. Math. 68 (2005) 239-253. 121. On detectable colorings of graphs (with H. Escuadro) Math. Bohem. 130 (2005) 427-445. 120. Graphs with prescribed order and Hamiltonian number (with V. Saenpholphat). Congr. Numer. 175 (2005) 161-173. 119. On stratified domination in oriented graphs (with R. Gera) Congr. Numer. 173 (2005) 175-192. 118. On gamma-labelings of trees (with G. Chartrand, D. Erwin, and D. VanderJagt) Discuss. Math. Graph Theory 25 (2005) 363-383. 117. Realizable triples for stratified domination in graphs (with R. Gera) Math. Bohem. 130 (2005) 185-202. 116. Detour distance in graphs (with G. Chartrand and H. Escuadro). J. Combin. Math. Combin. Comput. 53 (2005) 75-94. 115. Local colorings of graphs. (with G. Chartrand, F. Saba, and E. Salehi). Util. Math. 67 (2005) 107-120. 114. Gamma-labelings of graphs (with G. Chartrand, D. Erwin, and D. VanderJagt) Bull. Inst. Combin Appl. 44 (2005) 51-68. 113. On the dimension of trees (with R. C. Brigham, G. Chartrand, and R. D. Dutton) Discrete Math. 294 (2005) 279-283. 112. Homogeneously embedding stratified graphs in stratified graphs. (with G. Chartrand and D. VanderJagt). Math. Bohem. 130 (2005) 35-48. 111. On hamiltonian colorings of graphs (with G. Chartrand and L. Nebesky) Discrete Math.290 (2005) 133-143. 110. Resolving edge colorings in graphs. (with G. Chartrand and V. Saenpholphat). Ars Combin. 74 (2005) 33-47. 109. A graph labeling problem suggested by FM channel restrictions. (with G. Chartrand and D. Erwin) Bull. Inst. Combin Appl. 43 (2005) 43-57. 108. Hamiltonian colorings of graphs (with G. Chartrand and L. Nebesky) Discrete Appl. Math. 146 (2005) 257-272. |
2004 |
107. Homogeneously embeddings of
stratified 5-cycles.
(with G. Chartrand and D. VanderJagt)
Congr. Numer. 170 (2004) 205-222. 106. Detour resolvability in graphs. (with V. Saenpholphat) Congr. Numer. 169 (2004) 3-21. 105. A survey of Hamiltonian colorings of graphs. (with G. Chartrand and L. Nebesky) Congr. Numer. 169 (2004) 179-192. 104. Extremal problems on distances in graphs. (with G. Chartrand and H. Escuadro). Congr. Numer. 167 (2004) 133-147. 103. Bounds for the F-domination number of a graph. (with Ralucca Gera) Congr. Numer. 166 (2004) 131-144. 102. On connected resolving decompositions in graphs. (with V. Saenpholphat). Czechoslovak Math. J. 54 (2004) 681-696. 101. Hamiltonian domination in graphs. (with G. Chartrand, T. W. Haynes, and M. A. Henning). Util. Math. 66 (2004) 33-45. 100. Conditional resolvability in graphs: A Survey (with V. Saenpholphat). Internat. J. Math. Math. Sci. 38 (2004) 99. A new look at Hamiltonian walks. (with G. Chartrand, T. Thomas, and V. Saenpholphat) Bull. Inst. Combin Appl. 42 (2004) 37-52. 98. Distance in graphs - Taking the long view (with G. Chartrand). AKCE J. of Graphs Combin. 1 (2004) 1-13. 97. On the detour number and geodetic number of a graph. (with G. Chartrand and G. L. Johns) Ars Combin. 72 (2004) 3-15. 96. Forcing full domination in graphs. (with R. C. Brigham, G. Chartrand, and R. D. Dutton) J. Combin. Math. Combin. Comput. 49 (2004) 97-111. 95. Detour domination in graphs. (with G. Chartrand, T. W. Haynes, and M. A. Henning) Ars Combin. 71 (2004) 149-160. 94. On resolving acyclic partitions of graphs. (with V. Saenpholphat). Ars Combin. 71 (2004) 65-78. 93. On boundary vertices in graphs. (with G. Chartrand, D. Erwin, and G. L. Johns) J. Combin. Math. Combin. Comput. 48 (2004) 39-53. 92. Resolving acyclic partitions of graphs. (with V. Saenpholphat). Ars Combin. 70 (2004) 61-74. 91. Radio k-colorings of paths (with G. Chartrand and L. Nebesky). Discuss. Math. Graph Theory 24 (2004) 5-21. |
2003 |
90. Algebraic and combinatorial ways of computing the Mobius function and the characteristic polynomial of truncated Boolean algebras.
Sci. Ser. A. Math. Sci. (N.S.)
6 (1994/00) 129-141 (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. 130 (1998)
157-168. 6. Extremal problems in geodetic graph theory (with G. Chartrand and F. Harary). Congr. Numer. 131 (1998) 55-66. 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. |