Gary Chartrand

Publication Activity (10 Years)

Years Active: 1973-2024
Publications (10 Years): 11

Top Topics

Irregularly Shaped

Structured Objects

Connected Graphs

Top Venues

Discuss. Math. Graph Theory

AKCE Int. J. Graphs Comb.

Publications

Gary Chartrand, Ebrahim Salehi, Ping Zhang
On subset labelings of trees. AKCE Int. J. Graphs Comb. 21 (1) (2024)
Gary Chartrand, Ritabrato Chatterjee, Ping Zhang
Ramsey Chains in Linear Forests. Axioms 12 (11) (2023)
Gary Chartrand, Ping Zhang
The Ascending Ramsey Index of a Graph. Symmetry 15 (2) (2023)
Peter Broe, Gary Chartrand, Ping Zhang
Irregular orbital domination in graphs. Int. J. Comput. Math. Comput. Syst. Theory 7 (1) (2022)
Gary Chartrand, Yuya Kono, Ping Zhang
Distance Vertex Identification in Graphs. J. Interconnect. Networks 21 (1) (2021)
Gary Chartrand, Ping Zhang
Uniformly Connected Graphs - A Survey. Parallel Process. Lett. 30 (3) (2020)
Gary Chartrand, Ping Zhang
Ramsey sequences of graphs. AKCE Int. J. Graphs Comb. 17 (2) (2020)
Gary Chartrand, Stephen Devereaux, Teresa W. Haynes, Stephen T. Hedetniemi, Ping Zhang
Rainbow disconnection in graphs. Discuss. Math. Graph Theory 38 (4) (2018)
Zhenming Bi, Gary Chartrand, Ping Zhang
Another view of bipartite Ramsey numbers. Discuss. Math. Graph Theory 38 (2) (2018)
Gary Chartrand, Sean English, Ping Zhang
Kaleidoscopic colorings of graphs. Discuss. Math. Graph Theory 37 (3) (2017)
Eric Andrews, Gary Chartrand, Chira Lumduanhom, Ping Zhang
Stars and Their k-Ramsey Numbers. Graphs Comb. 33 (2) (2017)
Gary Chartrand, Heather Jordan, Ping Zhang
A cycle decomposition conjecture for Eulerian graphs. Australas. J Comb. 58 (2014)
Gary Chartrand, Futaba Okamoto, Ping Zhang
Rainbow trees in graphs and generalized connectivity. Networks 55 (4) (2010)
Gary Chartrand, Futaba Okamoto, Ping Zhang
The Sigma Chromatic Number of a Graph. Graphs Comb. 26 (6) (2010)
Gary Chartrand, Futaba Okamoto, Craig W. Rasmussen, Ping Zhang
The set chromatic number of a graph. Discuss. Math. Graph Theory 29 (3) (2009)
Gary Chartrand, Garry L. Johns, Kathleen A. McKeon, Ping Zhang
The rainbow connectivity of a graph. Networks 54 (2) (2009)
Gary Chartrand, Futaba Okamoto, Ping Zhang
The metric chromatic number of a graph. Australas. J Comb. 44 (2009)
Gary Chartrand, Linda M. Lesniak, Donald W. VanderJagt, Ping Zhang
Recognizable colorings of graphs. Discuss. Math. Graph Theory 28 (1) (2008)
Gary Chartrand, Ladislav Nebesky, Ping Zhang
Distance defined by spanning trees in graphs. Discuss. Math. Graph Theory 27 (3) (2007)
Gary Chartrand, Sin-Min Lee, Ping Zhang
Uniformly cordial graphs. Discret. Math. 306 (8-9) (2006)
Gary Chartrand, Ladislav Nebesky, Ping Zhang
On hamiltonian colorings of graphs. Discret. Math. 290 (2/3) (2005)
Robert C. Brigham, Gary Chartrand, Ronald D. Dutton, Ping Zhang
On the dimension of trees. Discret. Math. 294 (3) (2005)
Gary Chartrand, Varaporn Saenpholphat, Ping Zhang
Resolving Edge Colorings in Graphs. Ars Comb. 74 (2005)
Gary Chartrand, Ladislav Nebesky, Ping Zhang
Hamiltonian colorings of graphs. Discret. Appl. Math. 146 (3) (2005)
Gary Chartrand, David Erwin, Donald W. VanderJagt, Ping Zhang
-labelings of trees. Discuss. Math. Graph Theory 25 (3) (2005)
Gary Chartrand, Garry L. Johns, Ping Zhang
On the Detour Number and Geodetic Number of a Graph. Ars Comb. 72 (2004)
Gary Chartrand, Ladislav Nebesky, Ping Zhang
Radio k-colorings of paths. Discuss. Math. Graph Theory 24 (1) (2004)
Gary Chartrand, Teresa W. Haynes, Michael A. Henning, Ping Zhang
Detour Domination in Graphs. Ars Comb. 71 (2004)
Gary Chartrand, Teresa W. Haynes, Michael A. Henning, Ping Zhang
Stratification and domination in graphs. Discret. Math. 272 (2-3) (2003)
Gary Chartrand, Peter Dankelmann, Michelle Schultz, Henda C. Swart
Twin Domination in Digraphs. Ars Comb. 67 (2003)
Gary Chartrand, Ping Zhang
Nonplanar Sequences of Iterated r-Jump Graphs. Ars Comb. 68 (2003)
Gary Chartrand, David Erwin, Garry L. Johns, Ping Zhang
Boundary vertices in graphs. Discret. Math. 263 (1-3) (2003)
Gary Chartrand, David Erwin, Michael A. Henning, Peter J. Slater, Ping Zhang
-1. Discret. Math. 269 (1-3) (2003)
Gary Chartrand, Ladislav Nebesky, Ping Zhang
-colorings of graphs. Discret. Math. 272 (1) (2003)
Peter S. Buczkowski, Gary Chartrand, Christopher Poisson, Ping Zhang
-dimensional graphs and their bases. Period. Math. Hung. 46 (1) (2003)
Gary Chartrand, Frank Harary, Ping Zhang
On the geodetic number of a graph. Networks 39 (1) (2002)
Gary Chartrand, Curtiss E. Wall, Ping Zhang
The Convexity Number of a Graph. Graphs Comb. 18 (2) (2002)
Gary Chartrand, John Frederick Fink, Ping Zhang
Convexity in oriented graphs. Discret. Appl. Math. 116 (1-2) (2002)
Gary Chartrand, Ping Zhang
The Steiner number of a graph. Discret. Math. 242 (1-3) (2002)
Gary Chartrand, Karen S. Novotny, Steven J. Winters
The ultracenter and central fringe of a graph. Networks 38 (1) (2001)
Gary Chartrand, David Erwin, Michael E. Raines, Ping Zhang
Orientation distance graphs. J. Graph Theory 36 (4) (2001)
Robert C. Brigham, Gary Chartrand, Ronald D. Dutton, Ping Zhang
Full domination in graphs. Discuss. Math. Graph Theory 21 (1) (2001)
Gary Chartrand, Ping Zhang
On graphs with a unique minimum hull set. Discuss. Math. Graph Theory 21 (1) (2001)
Gary Chartrand, Donald W. VanderJagt, Ping Zhang
On the planarity of iterated jump graphs. Discret. Math. 226 (1-3) (2001)
Gary Chartrand, David Erwin, Michael E. Raines, Ping Zhang
The Decomposition Dimension of Graphs. Graphs Comb. 17 (4) (2001)
Gary Chartrand, Frank Harary, Ping Zhang
Geodetic sets in graphs. Discuss. Math. Graph Theory 20 (1) (2000)
Gary Chartrand, Frank Harary, Ping Zhang
On the Hall Number of a Graph. Ars Comb. 57 (2000)
Gary Chartrand, Linda Eroh, Frank Harary, Ping Zhang
How large can the domination numbers of a graph be? Australas. J Comb. 21 (2000)
Gary Chartrand, Ping Zhang
The Geodetic Number of an Oriented Graph. Eur. J. Comb. 21 (2) (2000)
Gary Chartrand, Linda Eroh, Mark A. Johnson, Ortrud Oellermann
Resolvability in graphs and the metric dimension of a graph. Discret. Appl. Math. 105 (1-3) (2000)
Gary Chartrand, Ping Zhang
The forcing geodetic number of a graph. Discuss. Math. Graph Theory 19 (1) (1999)
Gary Chartrand, Weizhen Gu, Michelle Schultz, Steven J. Winters
Eccentric graphs. Networks 34 (2) (1999)
Gary Chartrand, Frank Harary, Bill Quan Yue
On the out-domination and in-domination numbers of a digraph. Discret. Math. (1999)
Gary Chartrand, Héctor Hevia, Elzbieta B. Jarrett, Michelle Schultz
Subgraph distances in graphs defined by edge transfers. Discret. Math. 170 (1-3) (1997)
Gary Chartrand, Grzegorz Kubicki, Christina M. Mynhardt, Farrokh Saba
On Graphs With a Unique Least Common Multiple. Ars Comb. 46 (1997)
Gary Chartrand, Heather Gavlas, Héctor Hevia, Mark A. Johnson
Rotation and jump distances between graphs. Discuss. Math. Graph Theory 17 (2) (1997)
Gary Chartrand, Michelle Schultz, Steven J. Winters
On eccentric vertices in graphs. Networks 28 (4) (1996)
Gary Chartrand, Heather Gavlas, Michelle Schultz
Convergent sequences of iterated H-line graphs. Discret. Math. 147 (1-3) (1995)
Gary Chartrand, Garry L. Johns, Songlin Tian, Steven J. Winters
Directed distance in digraphs: Centers and medians. J. Graph Theory 17 (4) (1993)
Gary Chartrand, Wayne Goddard, Michael A. Henning, Farrokh Saba, Henda C. Swart
Principal Common Divisors of Graphs. Eur. J. Comb. 14 (2) (1993)
Gary Chartrand, Héctor Hevia, Robin J. Wilson
The ubiquitous Petersen graph. Discret. Math. 100 (1-3) (1992)
Gary Chartrand, S. F. Kapoor, Terry A. McKee, Farrokh Saba
Edge-clique graphs. Graphs Comb. 7 (3) (1991)
Gary Chartrand, Ortrud R. Oellermann, Farrokh Saba, Hung Bin Zou
Greatest common subgraphs with specified properties. Graphs Comb. 5 (1) (1989)
Gary Chartrand, Héctor Hevia, Ortrud Oellermann, Farrokh Saba, Allen J. Schwenk
A Matter of Degree. SIAM J. Discret. Math. 2 (4) (1989)
Yousef Alavi, Gary Chartrand, Fan R. K. Chung, Paul Erdös, Ronald L. Graham, Ortrud R. Oellermann
Highly irregular graphs. J. Graph Theory 11 (2) (1987)
Yousef Alavi, Gary Chartrand, Ortrud R. Oellermann, Linda M. Lesniak
Bipartite regulation numbers. Discret. Math. 62 (2) (1986)
Gary Chartrand, Frank Harary, Ortrud R. Oellermann
On the regulation number of a multigraph. Graphs Comb. 1 (1) (1985)
Gary Chartrand, Ortrud R. Oellermann, Sergio Ruiz
-cyclic digraphs. Graphs Comb. 1 (1) (1985)
Gary Chartrand, S. F. Kapoor, E. A. Nordhaus
Hamiltonian path graphs. J. Graph Theory 7 (4) (1983)
Gary Chartrand, Ronald J. Gould, Albert D. Polimeni
On ramsey numbers of forests versus nearly complete graphs. J. Graph Theory 4 (2) (1980)
James M. Benedict, Gary Chartrand, Don R. Lick
Mixed ramsey numbers: Chromatic numbers versus graphs. J. Graph Theory 2 (2) (1978)
Frank Harary, Gary Chartrand
Editorial. J. Graph Theory 1 (1) (1977)
Gary Chartrand, Seymour Schuster
A note on cycle Ramsey numbers. Discret. Math. 5 (4) (1973)