Gary Chartrand
-
- Limits and Structures in Graph Theory 29
- Computational Theory and Mathematics top 0.02%
- Advanced Graph Theory Research 140
- Graph Labeling and Dimension Problems 106
- Complexity and Algorithms in Graphs 7
- Geometry and Topology top 0.1%
- Graph theory and applications 61
- Advanced Topology and Set Theory 12
-
- Interconnection Networks and Systems 10
-
- graph theory and CDMA systems 38
- Co-authors
- Ping ZhangOrtrud R. OellermannMark A. JohnsonLinda ErohMehdi BehzadFrank HararyLinda LesniakPaul A. Catlin
- Cited by
- Discrete Mathematics and CombinatoricsComputational Theory and MathematicsGeometry and Topology
- Journals
- Discrete Mathematics (15 papers)Graphs and Combinatorics (8 papers)Journal of Graph Theory (6 papers)
- Partner nations
- United StatesCzechiaChile
In The Last Decade
Gary Chartrand
186 papers receiving 5.9k citations
Hit Papers
Peers
Comparison fields: 5 of 147
- Discrete Mathematics and Combinatorics 1.2k
- Computational Theory and Mathematics 5.1k
- Geometry and Topology 2.0k
- Computer Graphics and Computer-Aided Design 232
- Computer Networks and Communications 1.2k
Countries citing papers authored by Gary Chartrand
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).
Fields of papers citing papers by Gary Chartrand
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
The 25 scholars most cited alongside Gary Chartrand, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
| # | Work | ||
|---|---|---|---|
| 1 | 2022 | 0 | |
| 2 | 2021 | 0 | |
| 3 | 2021 | 9 | |
| 4 | Proper mean colorings of graphs | 2020 | 1 |
| 5 | Rainbow Mean Colorings of Graphs | 2019 | 1 |
| 6 | A cycle decomposition conjecture for Eulerian graphs. | 2014 | 1 |
| 7 | A note on graphs with prescribed complete coloring numbers | 2010 | 0 |
| 8 | Resolving Edge Colorings in Graphs. | 2005 | 2 |
| 9 | On the detour number and geodetic number of a graph | 2004 | 17 |
| 10 | Distance in graphs - Taking the long view | 2004 | 13 |
| 11 | How large can the domination numbers of a graph be | 2000 | 1 |
| 12 | On the Hall Number of a Graph. | 2000 | 11 |
| 13 | Graph theory, combinatorics, and applications : proceedings of the Sixth Quadrennial International Conference on the Theory and Applications of Graphs, Western Michigan University | 1991 | 9 |
| 14 | The Theory and applications of graphs : Fourth International Conference, May 6-9, 1980, Western Michigan University, Kalamazoo, Michigan | 1981 | 1 |
| 15 | 1972 | 5 | |
| 16 | 1972 | 1 | |
| 17 | Introduction to the theory of graphs | 1971 | 154 |
| 18 | Line-Coloring of Signed Graphs. | 1969 | 31 |
| 19 | 1968 | 4 | |
| 20 | Planar Permutation Graphs | 1967 | 155 |
About Gary Chartrand
Gary Chartrand is a scholar working on Discrete Mathematics and Combinatorics, Computational Theory and Mathematics, Geometry and Topology, Computer Graphics and Computer-Aided Design and Theoretical Computer Science, having authored 202 papers that have together received 6.7k indexed citations. Recurring topics across this work include Advanced Graph Theory Research (140 papers), Graph Labeling and Dimension Problems (106 papers), Graph theory and applications (61 papers), graph theory and CDMA systems (38 papers), Limits and Structures in Graph Theory (29 papers), Advanced Topology and Set Theory (12 papers), Interconnection Networks and Systems (10 papers) and Complexity and Algorithms in Graphs (7 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (1.2k citations), Computational Theory and Mathematics (5.1k citations), Geometry and Topology (2.0k citations), Computer Graphics and Computer-Aided Design (232 citations) and Computer Networks and Communications (1.2k citations). Gary Chartrand has collaborated with scholars based in United States, Czechia and Chile. Frequent co-authors include Ping Zhang, Ortrud R. Oellermann, Ping Zhang, Mark A. Johnson, Linda Eroh, Mehdi Behzad, Ping Zhang, Frank Harary, Linda Lesniak and Paul A. Catlin. Their work appears in journals such as Discrete Mathematics, Graphs and Combinatorics, Journal of Graph Theory, Networks and Annals of the New York Academy of Sciences.
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.