What is he best known for?
The fields of study he is best known for:
- 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.
His most cited work include:
- Graphs and Digraphs (1158 citations)
- Graphs & Digraphs (510 citations)
- Resolvability in graphs and the metric dimension of a graph (481 citations)
What are the main themes of his work throughout his whole career to date?
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.
He most often published in these fields:
- Combinatorics (76.32%)
- Discrete mathematics (47.74%)
- Graph (14.29%)
What were the highlights of his more recent work (between 2009-2021)?
- Combinatorics (76.32%)
- Discrete mathematics (47.74%)
- Graph theory (8.27%)
In recent papers he was focusing on the following fields of study:
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.
Between 2009 and 2021, his most popular works were:
- 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)
In his most recent research, the most cited papers focused on:
- 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.
