- Home
- Best Scientists - Mathematics
- Gary Chartrand

Discipline name
D-index
D-index (Discipline H-index) only includes papers and citation values for an examined
discipline in contrast to General H-index which accounts for publications across all
disciplines.
Citations
Publications
World Ranking
National Ranking

Engineering and Technology
D-index
46
Citations
7,303
124
World Ranking
1866
National Ranking
774

Mathematics
D-index
50
Citations
7,981
176
World Ranking
802
National Ranking
401

- Graph theory
- Combinatorics
- Graph coloring

His primary areas of study are Combinatorics, Discrete mathematics, Connectivity, Graph theory and Graph. His research integrates issues of Algorithm and Rainbow in his study of Combinatorics. The various areas that Gary Chartrand examines in his Connectivity study include Partition dimension, Bound graph, Vertex, Upper and lower bounds and Metric dimension.

As part of the same scientific family, Gary Chartrand usually focuses on Bound graph, concentrating on Induced subgraph and intersecting with Real number. His Graph theory research includes themes of Mathematical proof, Algebra, Graph and Theoretical computer science. His Graph study integrates concerns from other disciplines, such as Geodesic and Core-Plus Mathematics Project.

- Graphs and Digraphs (1158 citations)
- Graphs & Digraphs (510 citations)
- Resolvability in graphs and the metric dimension of a graph (481 citations)

Combinatorics, Discrete mathematics, Graph, Connectivity and Bound graph are his primary areas of study. His study in Graph power, Vertex, Indifference graph, Chordal graph and Neighbourhood is done as part of Combinatorics. In his research on the topic of Chordal graph, 1-planar graph is strongly related with Pathwidth.

His biological study deals with issues like Graph theory, which deal with fields such as Theoretical computer science. His Connectivity study frequently links to related topics such as Upper and lower bounds. His studies deal with areas such as Strongly regular graph, Distance-regular graph and k-vertex-connected graph as well as Bound graph.

- Combinatorics (76.32%)
- Discrete mathematics (47.74%)
- Graph (14.29%)

- Combinatorics (76.32%)
- Discrete mathematics (47.74%)
- Graph theory (8.27%)

Gary Chartrand focuses on Combinatorics, Discrete mathematics, Graph theory, Edge coloring and Brooks' theorem. The study of Combinatorics is intertwined with the study of Rainbow in a number of ways. His work on Bound graph, Graph drawing and Crossing number as part of general Discrete mathematics study is frequently connected to Synchronizing and Factoring, therefore bridging the gap between diverse disciplines of science and establishing a new relationship between them.

His Bound graph research is multidisciplinary, incorporating perspectives in Neighbourhood, Connectivity and Wheel graph. His work carried out in the field of Graph theory brings together such families of science as Theoretical computer science and Artificial intelligence. His research investigates the link between Edge coloring and topics such as Greedy coloring that cross with problems in Graph coloring.

- Rainbow trees in graphs and generalized connectivity (130 citations)
- A First Course in Graph Theory (90 citations)
- The Sigma Chromatic Number of a Graph (29 citations)

- Combinatorics
- Graph theory
- Graph coloring

His main research concerns Combinatorics, Discrete mathematics, List coloring, Fractional coloring and Brooks' theorem. His work on Rainbow expands to the thematically related Combinatorics. His biological study spans a wide range of topics, including Connectivity, Rainbow coloring, Integer and Ordered graph.

His research on Discrete mathematics frequently links to adjacent areas such as Hamiltonian optics. Gary Chartrand has researched List coloring in several fields, including Complete coloring and Greedy coloring. His work investigates the relationship between Graph theory and topics such as Theoretical computer science that intersect with problems in Graph, Degree, Bipartite graph and Travelling salesman problem.

This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.

Graphs and Digraphs

E. Keith Lloyd;Mehdi Behzad;Gary Chartrand;Linda Lesniak-Foster.

**(1996)**

1892 Citations

Graphs & Digraphs

Gary Chartrand;Linda Lesniak;Ping Zhang.

**(1986)**

810 Citations

Resolvability in graphs and the metric dimension of a graph

Gary Chartrand;Linda Eroh;Mark A. Johnson;Ortrud R. Oellermann.

Discrete Applied Mathematics **(2000)**

771 Citations

Rainbow connection in graphs

Gary Chartrand;Garry L. Johns;Kathleen A. McKeon;Ping Zhang.

Mathematica Bohemica **(2008)**

658 Citations

Rainbow connection in graphs

Gary Chartrand;Garry L. Johns;Kathleen A. McKeon;Ping Zhang.

Mathematica Bohemica **(2008)**

658 Citations

Introductory Graph Theory

Gary Chartrand.

**(1984)**

502 Citations

Introductory Graph Theory

Gary Chartrand.

**(1984)**

502 Citations

Applied and algorithmic graph theory

Gary Ortrud R Chartrand.

**(1992)**

443 Citations

Applied and algorithmic graph theory

Gary Ortrud R Chartrand.

**(1992)**

443 Citations

Introduction to Graph Theory

Gary Chartrand;Ping Zhang.

**(2004)**

414 Citations

If you think any of the details on this page are incorrect, let us know.

Contact us

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

University of Johannesburg

New Mexico State University

Clemson University

Hungarian Academy of Sciences

Yale University

University of California, San Diego

University of California, San Diego

Monash University

National Yang Ming Chiao Tung University

University of Nottingham

University of Victoria

École Polytechnique Fédérale de Lausanne

Technical University of Berlin

Microsoft (United States)

Pfizer (United States)

Max Planck Society

Polytechnic University of Milan

Utrecht University

University of California, Davis

University College London

Rovira i Virgili University

Universidade de São Paulo

University of Florida

University of the Sunshine Coast

Something went wrong. Please try again later.