Gary Chartrand

Affiliations:
  • Western Michigan University, Department of Mathematics, Kalamazoo, MI, USA


According to our database1, Gary Chartrand authored at least 74 papers between 1973 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of one.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
On subset labelings of trees.
AKCE Int. J. Graphs Comb., 2024

2023
Ramsey Chains in Linear Forests.
Axioms, November, 2023

The Ascending Ramsey Index of a Graph.
Symmetry, February, 2023

2022
Irregular orbital domination in graphs.
Int. J. Comput. Math. Comput. Syst. Theory, 2022

2021
Distance Vertex Identification in Graphs.
J. Interconnect. Networks, 2021

2020
Uniformly Connected Graphs - A Survey.
Parallel Process. Lett., 2020

Ramsey sequences of graphs.
AKCE Int. J. Graphs Comb., 2020

2018
Rainbow disconnection in graphs.
Discuss. Math. Graph Theory, 2018

Another view of bipartite Ramsey numbers.
Discuss. Math. Graph Theory, 2018

2017
Stars and Their k-Ramsey Numbers.
Graphs Comb., 2017

Kaleidoscopic colorings of graphs.
Discuss. Math. Graph Theory, 2017

2014
A cycle decomposition conjecture for Eulerian graphs.
Australas. J Comb., 2014

2010
Rainbow trees in graphs and generalized connectivity.
Networks, 2010

The Sigma Chromatic Number of a Graph.
Graphs Comb., 2010

2009
The rainbow connectivity of a graph.
Networks, 2009

The set chromatic number of a graph.
Discuss. Math. Graph Theory, 2009

The metric chromatic number of a graph.
Australas. J Comb., 2009

2008
Recognizable colorings of graphs.
Discuss. Math. Graph Theory, 2008

2007
Distance defined by spanning trees in graphs.
Discuss. Math. Graph Theory, 2007

2006
Uniformly cordial graphs.
Discret. Math., 2006

2005
On <i>γ</i>-labelings of trees.
Discuss. Math. Graph Theory, 2005

On the dimension of trees.
Discret. Math., 2005

Hamiltonian colorings of graphs.
Discret. Appl. Math., 2005

Resolving Edge Colorings in Graphs.
Ars Comb., 2005

2004
Radio k-colorings of paths.
Discuss. Math. Graph Theory, 2004

On the Detour Number and Geodetic Number of a Graph.
Ars Comb., 2004

Detour Domination in Graphs.
Ars Comb., 2004

2003
On <i>k</i>-dimensional graphs and their bases.
Period. Math. Hung., 2003

Greedy <i>F</i>-colorings of graphs.
Discret. Math., 2003

Stratification and domination in graphs.
Discret. Math., 2003

Boundary vertices in graphs.
Discret. Math., 2003

Graphs of order <i>n</i> with locating-chromatic number <i>n</i>-1.
Discret. Math., 2003

Nonplanar Sequences of Iterated r-Jump Graphs.
Ars Comb., 2003

Twin Domination in Digraphs.
Ars Comb., 2003

Graphical Measurement.
Proceedings of the Handbook of Graph Theory., 2003

2002
On the geodetic number of a graph.
Networks, 2002

The Convexity Number of a Graph.
Graphs Comb., 2002

The Steiner number of a graph.
Discret. Math., 2002

Convexity in oriented graphs.
Discret. Appl. Math., 2002

2001
The ultracenter and central fringe of a graph.
Networks, 2001

Orientation distance graphs.
J. Graph Theory, 2001

The Decomposition Dimension of Graphs.
Graphs Comb., 2001

On graphs with a unique minimum hull set.
Discuss. Math. Graph Theory, 2001

Full domination in graphs.
Discuss. Math. Graph Theory, 2001

On the planarity of iterated jump graphs.
Discret. Math., 2001

2000
The Geodetic Number of an Oriented Graph.
Eur. J. Comb., 2000

Geodetic sets in graphs.
Discuss. Math. Graph Theory, 2000

Resolvability in graphs and the metric dimension of a graph.
Discret. Appl. Math., 2000

On the Hall Number of a Graph.
Ars Comb., 2000

How large can the domination numbers of a graph be?
Australas. J Comb., 2000

1999
Eccentric graphs.
Networks, 1999

The forcing geodetic number of a graph.
Discuss. Math. Graph Theory, 1999

On the out-domination and in-domination numbers of a digraph.
Discret. Math., 1999

1997
Rotation and jump distances between graphs.
Discuss. Math. Graph Theory, 1997

Subgraph distances in graphs defined by edge transfers.
Discret. Math., 1997

On Graphs With a Unique Least Common Multiple.
Ars Comb., 1997

1996
On eccentric vertices in graphs.
Networks, 1996

1995
Convergent sequences of iterated H-line graphs.
Discret. Math., 1995

1993
Directed distance in digraphs: Centers and medians.
J. Graph Theory, 1993

Principal Common Divisors of Graphs.
Eur. J. Comb., 1993

1992
The ubiquitous Petersen graph.
Discret. Math., 1992

1991
Edge-clique graphs.
Graphs Comb., 1991

1989
A Matter of Degree.
SIAM J. Discret. Math., 1989

Greatest common subgraphs with specified properties.
Graphs Comb., 1989

1987
Highly irregular graphs.
J. Graph Theory, 1987

1986
Bipartite regulation numbers.
Discret. Math., 1986

Graphs and digraphs (2. ed.).
Wadsworth & Brooks / Cole mathematics series, Wadsworth, ISBN: 978-0-534-06324-5, 1986

1985
Randomly<i>n</i>-cyclic digraphs.
Graphs Comb., 1985

On the regulation number of a multigraph.
Graphs Comb., 1985

1983
Hamiltonian path graphs.
J. Graph Theory, 1983

1980
On ramsey numbers of forests versus nearly complete graphs.
J. Graph Theory, 1980

1978
Mixed ramsey numbers: Chromatic numbers versus graphs.
J. Graph Theory, 1978

1977
Editorial.
J. Graph Theory, 1977

1973
A note on cycle Ramsey numbers.
Discret. Math., 1973


  Loading...