×

Autobiographical notes. (English) Zbl 1438.01005

MSC:

01A70 Biographies, obituaries, personalia, bibliographies

Biographic References:

Chartrand, Gary
PDFBibTeX XMLCite
Full Text: Link

References:

[1] Y. Alavi, A. J. Boals, G. Chartrand, P. Erd˝os, O. R. Oellermann, The ascending subgraph decomposition problem, Congress. Numer. 58 (1987) 7-14.
[2] Y. Alavi, G. Chartrand, F. R. K. Chung, P. Erd˝os, O. R. Oellermann, Highly irregular graphs, J. Graph Theory 11 (1987) 235-249.
[3] E. Andrews, G. Chartrand, C. Lumduanhom, and P. Zhang, Stars and their k-Ramsey numbers, Graphs Combin. 33 (2017) 257-274. · Zbl 1368.05076
[4] K. S. Bagga, L. W. Beineke, G. Chartrand, O. R. Oellermann, Variations on a theorem of Petersen, Period. Math. Hungar. 19 (1988) 241-247. · Zbl 0695.05035
[5] Z. Bi, G. Chartrand, P. Zhang, Another view of bipartite Ramsey numbers, Discuss. Math. Graph Theory 38 (2018) 587-605. · Zbl 1390.05106
[6] G. Chartrand, A graph-theoretic approach to a communications problem, J. SIAM Appl. Math. 14 (1966) 778-781. · Zbl 0145.20605
[7] G. Chartrand, The existence of complete cycles in repeated line-graphs, Bull. Amer. Math. Soc. 71 (1965) 668-670. · Zbl 0133.16801
[8] G. Chartrand, E. Andrews, H. Jordon, P. Zhang, On the Eulerian cycle decomposition conjecture and complete multipartite graphs, Bull. Inst. Combin. Appl. 73 (2015) 23-46. · Zbl 1330.05092
[9] G. Chartrand, S. Devereaux, T. Haynes, S. Hedetniemi, P. Zhang, Rainbow disconnection in graphs, Discuss. Math. Graph Theory 38 (2018) 1007-1021. · Zbl 1392.05038
[10] G. Chartrand, P. Erd˝os, O. R. Oellermann, How to define an irregular graph, College Math. J. 19 (1988) 36-42.
[11] G. Chartrand, L. Eroh, M. A. Johnson, O. R. Oellermann, Resolvability in graphs and the metric dimension of a graph, Discrete Appl. Math. 105 (2000) 99-113. · Zbl 0958.05042
[12] G. Chartrand, D. Erwin, F. Harary, P. Zhang, Radio labelings of graphs, Bull. Inst. Combin. Appl. 33 (2001) 77-85. · Zbl 0989.05102
[13] G. Chartrand, D. Erwin, G. L. Johns, P. Zhang, Boundary vertices in graphs, Discrete Math. 263 (2003) 25-34. · Zbl 1020.05024
[14] G. Chartrand, D. Erwin, M. A. Henning, P. J. Slater, P. Zhang, The locating-chromatic number of a graph, Bull. Inst. Combin. Appl. 36 (2002) 89-101. · Zbl 1009.05056
[15] G. Chartrand, D. Geller, S. Hedetniemi, Graphs with forbidden subgraphs, J. Comb. Theory B 10 (1971) 12-41. · Zbl 0223.05101
[16] G. Chartrand, F. Harary, Planar permutation graphs, Ann. Inst. H. Poincare (Sect. B) 3 (1967) 433-438. · Zbl 0162.27605
[17] G. Chartrand, F. Harary, P. Zhang, Geodetic sets in graphs, Discuss. Math. Graph Theory 20 (2000) 129-138. · Zbl 0958.05044
[18] G. Chartrand, F. Harary, P. Zhang, On the geodetic number of a graph, Networks 39 (2002) 1-6. · Zbl 0987.05047
[19] G. Chartrand, F. Harary, P. Zhang, On the hull number of a graph, Ars Combin. 57 (2000) 129-138. · Zbl 1064.05049
[20] G. Chartrand, T. W. Haynes, M. A. Henning, P. Zhang, Stratification and domination in graphs, Discrete Math. 272 (2003) 171-185. · Zbl 1028.05074
[21] G. Chartrand, S. T. Hedetniemi, F. Okamoto, P. Zhang, A four colorings theorem, J. Combin. Math. Combin. Comput. 77 (2011) 75-87. 91 · Zbl 1233.05100
[22] G. Chartrand, M. A. Henning, H. Hevia, E. B. Jarrett, A new characterization of the Petersen graph, J. Combin. Inf. Syst. Sci. 20 (1995) 219-227. · Zbl 0872.05048
[23] G. Chartrand, H. Hevia, M. A. Johnson, A representation of chemical transformations by labeled graphs, J. Math. Chem. 12 (1993) 59-80.
[24] G. Chartrand, H. Hevia, R. J. Wilson, The ubiquitous Petersen graph, Discrete Math. 100 (1992) 303-311. · Zbl 0778.05070
[25] G. Chartrand, H. Hevia, E. B. Jarrett, M. Schultz, Subgraph distances defined by edge transfers, Discrete Math. 170 (1997) 63-79.
[26] G. Chartrand, M. S. Jacobson, J. Lehel, O. R. Oellermann, S. Ruiz, F. Saba, Irregular networks, Congress. Numer. 64 (1988) 197-210.
[27] G. Chartrand, G. L. Johns, K. A. McKeon, P. Zhang, Rainbow connection in graphs, Math. Bohem. 133 (2008) 85-98. · Zbl 1199.05106
[28] G. Chartrand, G. L. Johns, K. A. McKeon, P. Zhang, The rainbow connectivity of a graph, Networks 54 (2009) 75-81. · Zbl 1205.05124
[29] G. Chartrand, H. Jordon, P. Zhang, A cycle decomposition conjecture for Eulerian graphs, Australas. J. Combin. 58 (2014) 48-59. · Zbl 1296.05161
[30] G. Chartrand, K. Kolasinski, P. Zhang, The colored bridges problem, Geogr. Anal. 43 (2011) 370-382.
[31] G. Chartrand, J. Mitchem, Graphical theorems of the Nordhaus-Gaddum class, In: Recent Trends in Graph Theory, Springer-Verlag, Berlin, Heidelberg, 1971, pp. 55-61. · Zbl 0211.56702
[32] G. Chartrand, L. Nebesky, P. Zhang, Hamiltonian colorings of graphs, Discrete Appl. Math. 146 (2005) 257-272. · Zbl 1056.05054
[33] G. Chartrand, E. A. Nordhaus, Graphs hamiltonian-connected from a vertex, In: G. Chartrand, Y. Alavi, D. L. Goldsmith, L. Lesniak-Foster, D. L. Lick (Eds.), The Theory and Applications of Graphs, Wiley, New York, 1981, pp. 189-201. · Zbl 0471.05052
[34] G. Chartrand, O. R. Oellermann, S. Tian, H. B. Zou, Steiner distance in graphs, Casopis Pro Pest. Mat. 114 (1989) 399-410. · Zbl 0688.05040
[35] G. Chartrand, F. Okamoto, P. Zhang, Rainbow trees in graphs and generalized connectivity, Networks 55 (2010) 360-367. · Zbl 1205.05085
[36] G. Chartrand, F. Okamoto, P. Zhang, The sigma chromatic number of a graph, Graphs Combin. 26 (2010) 755-773. · Zbl 1207.05049
[37] G. Chartrand, F. Okamoto, Z. Tuza, P. Zhang, A note of graphs with prescribed complete colorings, J. Combin. Math. Combin. Comput. 73 (2010) 77-84. · Zbl 1198.05042
[38] G. Chartrand, F. Saba, H. B. Zou, Edge rotations and distance between graphs, Casopis Pro Pest. Mat. 110 (1985) 87-91. · Zbl 0567.05044
[39] G. Chartrand, E. Salehi, P. Zhang, On the partition dimension of a graph, Congr. Numer. 131 (1998) 55-66. · Zbl 0952.05021
[40] G. Chartrand, T. Thomas, V. Saenpholphat, P. Zhang, A new look at Hamiltonian walks, Bull. Inst. Combin. Appl. 42 (2004) 37-52. · Zbl 1056.05093
[41] G. Chartrand, C. E. Wall, On the hamiltonian index of a graph, Studia Sci. Math. Hungar. 8 (1973) 43-48. · Zbl 0279.05121
[42] G. Chartrand, C. E. Wall, P. Zhang, The convexity number of a graph, Graphs Combin. 18 (2002) 209-217. · Zbl 1002.05018
[43] G. Chartrand, R. J. Wilson, The Petersen graph, In: F. Harary, J. S. Maybee (Eds.), Graphs and Applications, Wiley, New York, 1985, pp. 69-100. · Zbl 0554.05058
[44] G. Chartrand, P. Zhang, The Steiner number of a graph, Discrete Math. 242 (2002) 41-54. · Zbl 0988.05034
[45] D. C. Kay, G. Chartrand, A characterization of certain ptolemaic graphs, Canad. J. Math. 17 (1965) 342-346. · Zbl 0139.17301
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.