Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies
if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the
same subfield and year (this is the minimum needed to enter the top 1%, not the average
within it), or reaches the top citation threshold in at least one of its specific research
topics.
Countries citing papers authored by Gary Chartrand
Since
Specialization
Citations
This map shows the geographic impact of Gary Chartrand's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Gary Chartrand with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Gary Chartrand more than expected).
This network shows the impact of papers produced by Gary Chartrand. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Gary Chartrand. The network helps show where Gary Chartrand may publish in the future.
Co-authorship network of co-authors of Gary Chartrand
This figure shows the co-authorship network connecting the top 25 collaborators of Gary Chartrand.
A scholar is included among the top collaborators of Gary Chartrand based on the total number of
citations received by their joint publications. Widths of edges
represent the number of papers authors have co-authored together.
Node borders
signify the number of papers an author published with Gary Chartrand. Gary Chartrand is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Chartrand, Gary, et al.. (2020). Proper mean colorings of graphs. SHILAP Revista de lepidopterología.1 indexed citations
3.
Chartrand, Gary, et al.. (2019). Rainbow Mean Colorings of Graphs. SHILAP Revista de lepidopterología.1 indexed citations
4.
Chartrand, Gary, et al.. (2014). A cycle decomposition conjecture for Eulerian graphs.. The Australasian Journal of Combinatorics. 58(1). 48–59.1 indexed citations
5.
Chartrand, Gary, Futaba Okamoto, & Ping Zhang. (2009). The metric chromatic number of a graph.. The Australasian Journal of Combinatorics. 44. 273–286.12 indexed citations
6.
Chartrand, Gary, Futaba Okamoto, Ebrahim Salehi, & Ping Zhang. (2009). The multiset chromatic number of a graph. Mathematica Bohemica. 134(2). 191–209.5 indexed citations
7.
Chartrand, Gary, Garry L. Johns, & Ping Zhang. (2004). On the detour number and geodetic number of a graph. Ars Combinatoria. 72. 3–15.17 indexed citations
8.
Chartrand, Gary, et al.. (2003). Twin Domination in Digraphs.. Ars Combinatoria. 67.19 indexed citations
Chartrand, Gary, Linda Eroh, Frank Harary, & Ping Zhang. (2000). How large can the domination numbers of a graph be. The Australasian Journal of Combinatorics. 21. 23–35.1 indexed citations
12.
Alavi, Yousef, et al.. (1991). Graph theory, combinatorics, and applications : proceedings of the Sixth Quadrennial International Conference on the Theory and Applications of Graphs, Western Michigan University. Wiley eBooks.9 indexed citations
Chartrand, Gary & Linda Lesniak. (1986). Graphs & digraphs (2nd ed.). 74(3). 66–7.28 indexed citations
15.
Chartrand, Gary, et al.. (1972). On a variation of the Ramsey number. Transactions of the American Mathematical Society. 173(0). 353–362.5 indexed citations
16.
Behzad, Mehdi & Gary Chartrand. (1971). Introduction to the theory of graphs. Allyn and Bacon eBooks.154 indexed citations
17.
Chartrand, Gary & Mehdi Behzad. (1969). Line-Coloring of Signed Graphs.. 24. 49–52.31 indexed citations
18.
Chartrand, Gary & Sanjiv Kapoor. (1969). The Many facets of graph theory : proceedings of the conference held at Western Michigan University, Kalamazoo/Ml., October 31-November 2, 1968. Springer eBooks.
19.
Beineke, Lowell W. & Gary Chartrand. (1968). The coarseness of a graph. Compositio Mathematica. 19(4). 290–298.5 indexed citations
20.
Chartrand, Gary & Frank Harary. (1967). Planar Permutation Graphs. French digital mathematics library (Numdam). 3(4). 433–438.155 indexed citations
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive
bibliographic database. While OpenAlex provides broad and valuable coverage of the global
research landscape, it—like all bibliographic datasets—has inherent limitations. These include
incomplete records, variations in author disambiguation, differences in journal indexing, and
delays in data updates. As a result, some metrics and network relationships displayed in
Rankless may not fully capture the entirety of a scholar's output or impact.