Gary Chartrand

Gary Chartrand, Futaba Okamoto, Ping Zhang: The Sigma Chromatic Number of a Graph. Graphs and Combinatorics 26(6): 755-773 (2010)

Gary Chartrand, Futaba Okamoto, Ping Zhang: Rainbow trees in graphs and generalized connectivity. Networks 55(4): 360-367 (2010)

Gary Chartrand, Futaba Okamoto, Craig W. Rasmussen, Ping Zhang: The set chromatic number of a graph. Discussiones Mathematicae Graph Theory 29(3): 545-561 (2009)

Gary Chartrand, Garry L. Johns, Kathleen A. McKeon, Ping Zhang: The rainbow connectivity of a graph. Networks 54(2): 75-81 (2009)

Gary Chartrand, Linda M. Lesniak, Donald W. VanderJagt, Ping Zhang: Recognizable colorings of graphs. Discussiones Mathematicae Graph Theory 28(1): 35-57 (2008)

Gary Chartrand, Ladislav Nebesky, Ping Zhang: Distance defined by spanning trees in graphs. Discussiones Mathematicae Graph Theory 27(3): 485-506 (2007)

Gary Chartrand, Sin-Min Lee, Ping Zhang: Uniformly cordial graphs. Discrete Mathematics 306(8-9): 726-737 (2006)

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. Discrete Applied Mathematics 146(3): 257-272 (2005)

Gary Chartrand, Ladislav Nebesky, Ping Zhang: On hamiltonian colorings of graphs. Discrete Mathematics 290(2/3): 133-143 (2005)

Robert C. Brigham, Gary Chartrand, Ronald D. Dutton, Ping Zhang: On the dimension of trees. Discrete Mathematics 294(3): 279-283 (2005)

Gary Chartrand, David Erwin, Donald W. VanderJagt, Ping Zhang: On γ-labelings of trees. Discussiones Mathematicae Graph Theory 25(3): 363-383 (2005)

Gary Chartrand, Teresa W. Haynes, Michael A. Henning, Ping Zhang: Detour Domination in Graphs. Ars Comb. 71 (2004)

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. Discussiones Mathematicae Graph Theory 24(1): 5-21 (2004)

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. Discrete Mathematics 263(1-3): 25-34 (2003)

Gary Chartrand, David Erwin, Michael A. Henning, Peter J. Slater, Ping Zhang: Graphs of order n with locating-chromatic number n-1. Discrete Mathematics 269(1-3): 65-79 (2003)

Gary Chartrand, Ladislav Nebesky, Ping Zhang: Greedy F-colorings of graphs. Discrete Mathematics 272(1): 37-46 (2003)

Gary Chartrand, Teresa W. Haynes, Michael A. Henning, Ping Zhang: Stratification and domination in graphs. Discrete Mathematics 272(2-3): 171-185 (2003)

Peter S. Buczkowski, Gary Chartrand, Christopher Poisson, Ping Zhang: On k-dimensional graphs and their bases. Periodica Mathematica Hungarica 46(1): 9-15 (2003)

Gary Chartrand, John Frederick Fink, Ping Zhang: Convexity in oriented graphs. Discrete Applied Mathematics 116(1-2): 115-126 (2002)

Gary Chartrand, Ping Zhang: The Steiner number of a graph. Discrete Mathematics 242(1-3): 41-54 (2002)

Gary Chartrand, Curtiss E. Wall, Ping Zhang: The Convexity Number of a Graph. Graphs and Combinatorics 18(2): 209-217 (2002)

Gary Chartrand, Frank Harary, Ping Zhang: On the geodetic number of a graph. Networks 39(1): 1-6 (2002)

Gary Chartrand, Donald W. VanderJagt, Ping Zhang: On the planarity of iterated jump graphs. Discrete Mathematics 226(1-3): 93-106 (2001)

Gary Chartrand, Ping Zhang: On graphs with a unique minimum hull set. Discussiones Mathematicae Graph Theory 21(1): 31-42 (2001)

Robert C. Brigham, Gary Chartrand, Ronald D. Dutton, Ping Zhang: Full domination in graphs. Discussiones Mathematicae Graph Theory 21(1): 43-62 (2001)

Gary Chartrand, David Erwin, Michael Raines, Ping Zhang: The Decomposition Dimension of Graphs. Graphs and Combinatorics 17(4): 599-605 (2001)

Gary Chartrand, David Erwin, Michael Raines, Ping Zhang: Orientation distance graphs. Journal of Graph Theory 36(4): 230-241 (2001)

Gary Chartrand, Karen S. Novotny, Steven J. Winters: The ultracenter and central fringe of a graph. Networks 38(1): 33-38 (2001)

Gary Chartrand, Frank Harary, Ping Zhang: On the Hall Number of a Graph. Ars Comb. 57 (2000)

Gary Chartrand, Linda Eroh, Mark A. Johnson, Ortrud Oellermann: Resolvability in graphs and the metric dimension of a graph. Discrete Applied Mathematics 105(1-3): 99-113 (2000)

Gary Chartrand, Frank Harary, Ping Zhang: Geodetic sets in graphs. Discussiones Mathematicae Graph Theory 20(1): 129-138 (2000)

Gary Chartrand, Ping Zhang: The Geodetic Number of an Oriented Graph. Eur. J. Comb. 21(2): 181-189 (2000)

Gary Chartrand, Frank Harary, Bill Quan Yue: On the out-domination and in-domination numbers of a digraph. Discrete Mathematics 197-198: 179-183 (1999)

Gary Chartrand, Ping Zhang: The forcing geodetic number of a graph. Discussiones Mathematicae Graph Theory 19(1): 45-58 (1999)

Gary Chartrand, Weizhen Gu, Michelle Schultz, Steven J. Winters: Eccentric graphs. Networks 34(2): 115-121 (1999)

Gary Chartrand, Grzegorz Kubicki, Christina M. Mynhardt, Farrokh Saba: On Graphs With a Unique Least Common Multiple. Ars Comb. 46 (1997)

Gary Chartrand, Héctor Hevia, Elzbieta B. Jarrett, Michelle Schultz: Subgraph distances in graphs defined by edge transfers. Discrete Mathematics 170(1-3): 63-79 (1997)

Gary Chartrand, Heather Gavlas, Héctor Hevia, Mark A. Johnson: Rotation and jump distances between graphs. Discussiones Mathematicae Graph Theory 17(2): 285-300 (1997)

Gary Chartrand, Michelle Schultz, Steven J. Winters: On eccentric vertices in graphs. Networks 28(4): 181-186 (1996)

Gary Chartrand, Heather Gavlas, Michelle Schultz: Convergent sequences of iterated H-line graphs. Discrete Mathematics 147(1-3): 73-86 (1995)

Gary Chartrand, Wayne Goddard, Michael A. Henning, Farrokh Saba, Henda C. Swart: Principal Common Divisors of Graphs. Eur. J. Comb. 14(2): 85-93 (1993)

Gary Chartrand, Garry L. Johns, Songlin Tian, Steven J. Winters: Directed distance in digraphs: Centers and medians. Journal of Graph Theory 17(4): 509-521 (1993)

Gary Chartrand, Héctor Hevia, Robin J. Wilson: The ubiquitous Petersen graph. Discrete Mathematics 100(1-3): 303-311 (1992)

Gary Chartrand, S. F. Kapoor, Terry A. McKee, Farrokh Saba: Edge-clique graphs. Graphs and Combinatorics 7(3): 253-264 (1991)

Gary Chartrand, Ortrud R. Oellermann, Farrokh Saba, Hung Bin Zou: Greatest common subgraphs with specified properties. Graphs and Combinatorics 5(1): 1-14 (1989)

Gary Chartrand, Héctor Hevia, Ortrud Oellermann, Farrokh Saba, A. Schwenk: A Matter of Degree. SIAM J. Discrete Math. 2(4): 456-466 (1989)

Gary Chartrand, Linda M. Lesniak: Graphs and digraphs (2. ed.). Wadsworth & Brooks / Cole mathematics series, Wadsworth 1986, isbn 978-0-534-06324-5, pp. I-VIII, 1-359

Yousef Alavi, Gary Chartrand, Ortrud R. Oellermann, Linda M. Lesniak: Bipartite regulation numbers. Discrete Mathematics 62(2): 113-118 (1986)

Gary Chartrand, Ortrud R. Oellermann, Sergio Ruiz: Randomlyn-cyclic digraphs. Graphs and Combinatorics 1(1): 29-40 (1985)

Gary Chartrand, Frank Harary, Ortrud R. Oellermann: On the regulation number of a multigraph. Graphs and Combinatorics 1(1): 137-144 (1985)