default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGary Chartrand
Person information
- affiliation: Western Michigan University, Department of Mathematics, Kalamazoo, MI, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j73]Gary Chartrand, Ebrahim Salehi, Ping Zhang:
On subset labelings of trees. AKCE Int. J. Graphs Comb. 21(1): 84-90 (2024)- 2023
- [j72]Gary Chartrand, Ritabrato Chatterjee, Ping Zhang:
Ramsey Chains in Linear Forests. Axioms 12(11): 1019 (2023) - [j71]Gary Chartrand, Ping Zhang:
The Ascending Ramsey Index of a Graph. Symmetry 15(2): 523 (2023) - 2022
- [j70]Peter Broe, Gary Chartrand, Ping Zhang:
Irregular orbital domination in graphs. Int. J. Comput. Math. Comput. Syst. Theory 7(1): 68-79 (2022) - 2021
- [j69]Gary Chartrand, Yuya Kono, Ping Zhang:
Distance Vertex Identification in Graphs. J. Interconnect. Networks 21(1): 2150005:1-2150005:15 (2021) - 2020
- [j68]Gary Chartrand, Ping Zhang:
Ramsey sequences of graphs. AKCE Int. J. Graphs Comb. 17(2): 646-652 (2020) - [j67]Gary Chartrand, Ping Zhang:
Uniformly Connected Graphs - A Survey. Parallel Process. Lett. 30(3): 2040002:1-2040002:16 (2020)
2010 – 2019
- 2018
- [j66]Zhenming Bi, Gary Chartrand, Ping Zhang:
Another view of bipartite Ramsey numbers. Discuss. Math. Graph Theory 38(2): 587-605 (2018) - [j65]Gary Chartrand, Stephen Devereaux, Teresa W. Haynes, Stephen T. Hedetniemi, Ping Zhang:
Rainbow disconnection in graphs. Discuss. Math. Graph Theory 38(4): 1007-1021 (2018) - 2017
- [j64]Gary Chartrand, Sean English, Ping Zhang:
Kaleidoscopic colorings of graphs. Discuss. Math. Graph Theory 37(3): 711-727 (2017) - [j63]Eric Andrews, Gary Chartrand, Chira Lumduanhom, Ping Zhang:
Stars and Their k-Ramsey Numbers. Graphs Comb. 33(2): 257-274 (2017) - 2014
- [j62]Gary Chartrand, Heather Jordan, Ping Zhang:
A cycle decomposition conjecture for Eulerian graphs. Australas. J Comb. 58: 48-59 (2014) - 2010
- [j61]Gary Chartrand, Futaba Okamoto, Ping Zhang:
The Sigma Chromatic Number of a Graph. Graphs Comb. 26(6): 755-773 (2010) - [j60]Gary Chartrand, Futaba Okamoto, Ping Zhang:
Rainbow trees in graphs and generalized connectivity. Networks 55(4): 360-367 (2010)
2000 – 2009
- 2009
- [j59]Gary Chartrand, Futaba Okamoto, Ping Zhang:
The metric chromatic number of a graph. Australas. J Comb. 44: 273-286 (2009) - [j58]Gary Chartrand, Futaba Okamoto, Craig W. Rasmussen, Ping Zhang:
The set chromatic number of a graph. Discuss. Math. Graph Theory 29(3): 545-561 (2009) - [j57]Gary Chartrand, Garry L. Johns, Kathleen A. McKeon, Ping Zhang:
The rainbow connectivity of a graph. Networks 54(2): 75-81 (2009) - 2008
- [j56]Gary Chartrand, Linda M. Lesniak, Donald W. VanderJagt, Ping Zhang:
Recognizable colorings of graphs. Discuss. Math. Graph Theory 28(1): 35-57 (2008) - 2007
- [j55]Gary Chartrand, Ladislav Nebesky, Ping Zhang:
Distance defined by spanning trees in graphs. Discuss. Math. Graph Theory 27(3): 485-506 (2007) - 2006
- [j54]Gary Chartrand, Sin-Min Lee, Ping Zhang:
Uniformly cordial graphs. Discret. Math. 306(8-9): 726-737 (2006) - 2005
- [j53]Gary Chartrand, Varaporn Saenpholphat, Ping Zhang:
Resolving Edge Colorings in Graphs. Ars Comb. 74 (2005) - [j52]Gary Chartrand, Ladislav Nebesky, Ping Zhang:
Hamiltonian colorings of graphs. Discret. Appl. Math. 146(3): 257-272 (2005) - [j51]Gary Chartrand, Ladislav Nebesky, Ping Zhang:
On hamiltonian colorings of graphs. Discret. Math. 290(2/3): 133-143 (2005) - [j50]Robert C. Brigham, Gary Chartrand, Ronald D. Dutton, Ping Zhang:
On the dimension of trees. Discret. Math. 294(3): 279-283 (2005) - [j49]Gary Chartrand, David Erwin, Donald W. VanderJagt, Ping Zhang:
On γ-labelings of trees. Discuss. Math. Graph Theory 25(3): 363-383 (2005) - 2004
- [j48]Gary Chartrand, Teresa W. Haynes, Michael A. Henning, Ping Zhang:
Detour Domination in Graphs. Ars Comb. 71 (2004) - [j47]Gary Chartrand, Garry L. Johns, Ping Zhang:
On the Detour Number and Geodetic Number of a Graph. Ars Comb. 72 (2004) - [j46]Gary Chartrand, Ladislav Nebesky, Ping Zhang:
Radio k-colorings of paths. Discuss. Math. Graph Theory 24(1): 5-21 (2004) - 2003
- [j45]Gary Chartrand, Peter Dankelmann, Michelle Schultz, Henda C. Swart:
Twin Domination in Digraphs. Ars Comb. 67 (2003) - [j44]Gary Chartrand, Ping Zhang:
Nonplanar Sequences of Iterated r-Jump Graphs. Ars Comb. 68 (2003) - [j43]Gary Chartrand, David Erwin
, Garry L. Johns, Ping Zhang:
Boundary vertices in graphs. Discret. Math. 263(1-3): 25-34 (2003) - [j42]Gary Chartrand, David Erwin, Michael A. Henning, Peter J. Slater, Ping Zhang:
Graphs of order n with locating-chromatic number n-1. Discret. Math. 269(1-3): 65-79 (2003) - [j41]Gary Chartrand, Ladislav Nebesky, Ping Zhang:
Greedy F-colorings of graphs. Discret. Math. 272(1): 37-46 (2003) - [j40]Gary Chartrand, Teresa W. Haynes, Michael A. Henning, Ping Zhang:
Stratification and domination in graphs. Discret. Math. 272(2-3): 171-185 (2003) - [j39]Peter S. Buczkowski, Gary Chartrand, Christopher Poisson, Ping Zhang:
On k-dimensional graphs and their bases. Period. Math. Hung. 46(1): 9-15 (2003) - [p1]Gary Chartrand, Ping Zhang, Teresa W. Haynes, Michael A. Henning, Fred R. McMorris, Robert C. Brigham:
Graphical Measurement. Handbook of Graph Theory 2003: 872-951 - 2002
- [j38]Gary Chartrand, John Frederick Fink, Ping Zhang:
Convexity in oriented graphs. Discret. Appl. Math. 116(1-2): 115-126 (2002) - [j37]Gary Chartrand, Ping Zhang:
The Steiner number of a graph. Discret. Math. 242(1-3): 41-54 (2002) - [j36]Gary Chartrand, Curtiss E. Wall, Ping Zhang:
The Convexity Number of a Graph. Graphs Comb. 18(2): 209-217 (2002) - [j35]Gary Chartrand, Frank Harary, Ping Zhang:
On the geodetic number of a graph. Networks 39(1): 1-6 (2002) - 2001
- [j34]Gary Chartrand, Donald W. VanderJagt, Ping Zhang:
On the planarity of iterated jump graphs. Discret. Math. 226(1-3): 93-106 (2001) - [j33]Gary Chartrand, Ping Zhang:
On graphs with a unique minimum hull set. Discuss. Math. Graph Theory 21(1): 31-42 (2001) - [j32]Robert C. Brigham, Gary Chartrand, Ronald D. Dutton, Ping Zhang:
Full domination in graphs. Discuss. Math. Graph Theory 21(1): 43-62 (2001) - [j31]Gary Chartrand, David Erwin, Michael E. Raines, Ping Zhang:
The Decomposition Dimension of Graphs. Graphs Comb. 17(4): 599-605 (2001) - [j30]Gary Chartrand, David Erwin, Michael E. Raines, Ping Zhang:
Orientation distance graphs. J. Graph Theory 36(4): 230-241 (2001) - [j29]Gary Chartrand, Karen S. Novotny, Steven J. Winters:
The ultracenter and central fringe of a graph. Networks 38(1): 33-38 (2001) - 2000
- [j28]Gary Chartrand, Linda Eroh, Frank Harary, Ping Zhang:
How large can the domination numbers of a graph be? Australas. J Comb. 21: 23-36 (2000) - [j27]Gary Chartrand, Frank Harary, Ping Zhang:
On the Hall Number of a Graph. Ars Comb. 57 (2000) - [j26]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): 99-113 (2000) - [j25]Gary Chartrand, Frank Harary, Ping Zhang:
Geodetic sets in graphs. Discuss. Math. Graph Theory 20(1): 129-138 (2000) - [j24]Gary Chartrand, Ping Zhang:
The Geodetic Number of an Oriented Graph. Eur. J. Comb. 21(2): 181-189 (2000)
1990 – 1999
- 1999
- [j23]Gary Chartrand, Frank Harary, Bill Quan Yue:
On the out-domination and in-domination numbers of a digraph. Discret. Math. 197-198: 179-183 (1999) - [j22]Gary Chartrand, Ping Zhang:
The forcing geodetic number of a graph. Discuss. Math. Graph Theory 19(1): 45-58 (1999) - [j21]Gary Chartrand, Weizhen Gu, Michelle Schultz, Steven J. Winters:
Eccentric graphs. Networks 34(2): 115-121 (1999) - 1997
- [j20]Gary Chartrand, Grzegorz Kubicki, Christina M. Mynhardt, Farrokh Saba:
On Graphs With a Unique Least Common Multiple. Ars Comb. 46 (1997) - [j19]Gary Chartrand, Héctor Hevia, Elzbieta B. Jarrett, Michelle Schultz:
Subgraph distances in graphs defined by edge transfers. Discret. Math. 170(1-3): 63-79 (1997) - [j18]Gary Chartrand, Heather Gavlas, Héctor Hevia, Mark A. Johnson:
Rotation and jump distances between graphs. Discuss. Math. Graph Theory 17(2): 285-300 (1997) - 1996
- [j17]Gary Chartrand, Michelle Schultz, Steven J. Winters:
On eccentric vertices in graphs. Networks 28(4): 181-186 (1996) - 1995
- [j16]Gary Chartrand, Heather Gavlas, Michelle Schultz:
Convergent sequences of iterated H-line graphs. Discret. Math. 147(1-3): 73-86 (1995) - 1993
- [j15]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) - [j14]Gary Chartrand, Garry L. Johns, Songlin Tian, Steven J. Winters:
Directed distance in digraphs: Centers and medians. J. Graph Theory 17(4): 509-521 (1993) - 1992
- [j13]Gary Chartrand, Héctor Hevia, Robin J. Wilson:
The ubiquitous Petersen graph. Discret. Math. 100(1-3): 303-311 (1992) - 1991
- [j12]Gary Chartrand, S. F. Kapoor, Terry A. McKee, Farrokh Saba:
Edge-clique graphs. Graphs Comb. 7(3): 253-264 (1991)
1980 – 1989
- 1989
- [j11]Gary Chartrand, Ortrud R. Oellermann, Farrokh Saba, Hung Bin Zou:
Greatest common subgraphs with specified properties. Graphs Comb. 5(1): 1-14 (1989) - [j10]Gary Chartrand, Héctor Hevia, Ortrud Oellermann, Farrokh Saba, Allen J. Schwenk:
A Matter of Degree. SIAM J. Discret. Math. 2(4): 456-466 (1989) - 1987
- [j9]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): 235-249 (1987) - 1986
- [b1]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 - [j8]Yousef Alavi, Gary Chartrand, Ortrud R. Oellermann, Linda M. Lesniak:
Bipartite regulation numbers. Discret. Math. 62(2): 113-118 (1986) - 1985
- [j7]Gary Chartrand, Ortrud R. Oellermann, Sergio Ruiz:
Randomlyn-cyclic digraphs. Graphs Comb. 1(1): 29-40 (1985) - [j6]Gary Chartrand, Frank Harary, Ortrud R. Oellermann:
On the regulation number of a multigraph. Graphs Comb. 1(1): 137-144 (1985) - 1983
- [j5]Gary Chartrand, S. F. Kapoor, E. A. Nordhaus:
Hamiltonian path graphs. J. Graph Theory 7(4): 419-427 (1983) - 1980
- [j4]Gary Chartrand, Ronald J. Gould, Albert D. Polimeni:
On ramsey numbers of forests versus nearly complete graphs. J. Graph Theory 4(2): 233-239 (1980)
1970 – 1979
- 1978
- [j3]James M. Benedict, Gary Chartrand, Don R. Lick:
Mixed ramsey numbers: Chromatic numbers versus graphs. J. Graph Theory 2(2): 107-118 (1978) - 1977
- [j2]Frank Harary, Gary Chartrand:
Editorial. J. Graph Theory 1(1): 1-2 (1977) - 1973
- [j1]Gary Chartrand, Seymour Schuster:
A note on cycle Ramsey numbers. Discret. Math. 5(4): 313-315 (1973)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-09 21:15 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
