The characteristic polynomials of subarrangements of Coxeter arrangements. - Ping Zhang 004 (Discret. Math., 1997)

The Steiner distance dimension of graphs. - Michael E. Raines; Ping Zhang 004 (Australas. J Comb., 1999)

The forcing geodetic number of a graph. - Gary Chartrand; Ping Zhang 004 (Discuss. Math. Graph Theory, 1999)

How large can the domination numbers of a graph be? - Gary Chartrand; Linda Eroh; Frank Harary; Ping Zhang 004 (Australas. J Comb., 2000)

On the Hall Number of a Graph. - Gary Chartrand; Frank Harary; Ping Zhang 004 (Ars Comb., 2000)

On the planarity of jump graphs. - Héctor Hevia; Donald W. VanderJagt; Ping Zhang 004 (Discret. Math., 2000)

Geodetic sets in graphs. - Gary Chartrand; Frank Harary; Ping Zhang 004 (Discuss. Math. Graph Theory, 2000)

The Geodetic Number of an Oriented Graph. - Gary Chartrand; Ping Zhang 004 (Eur. J. Comb., 2000)

On the planarity of iterated jump graphs. - Gary Chartrand; Donald W. VanderJagt; Ping Zhang 004 (Discret. Math., 2001)

Full domination in graphs. - Robert C. Brigham; Gary Chartrand; Ronald D. Dutton; Ping Zhang 004 (Discuss. Math. Graph Theory, 2001)

On graphs with a unique minimum hull set. - Gary Chartrand; Ping Zhang 004 (Discuss. Math. Graph Theory, 2001)

The Decomposition Dimension of Graphs. - Gary Chartrand; David Erwin; Michael E. Raines; Ping Zhang 004 (Graphs Comb., 2001)

Orientation distance graphs. - Gary Chartrand; David Erwin; Michael E. Raines; Ping Zhang 004 (J. Graph Theory, 2001)

k-Geodomination in graphs. - Raluca Muntean; Ping Zhang 004 (Ars Comb., 2002)

Radio Labelings of Cycles. - Ping Zhang 004 (Ars Comb., 2002)

Convexity in oriented graphs. - Gary Chartrand; John Frederick Fink; Ping Zhang 004 (Discret. Appl. Math., 2002)

The Steiner number of a graph. - Gary Chartrand; Ping Zhang 004 (Discret. Math., 2002)

Connected partition dimensions of graphs. - Varaporn Saenpholphat; Ping Zhang 004 (Discuss. Math. Graph Theory, 2002)

The Convexity Number of a Graph. - Gary Chartrand; Curtiss E. Wall; Ping Zhang 004 (Graphs Comb., 2002)

On the geodetic number of a graph. - Gary Chartrand; Frank Harary; Ping Zhang 004 (Networks, 2002)

Graphical Measurement. - Gary Chartrand; Ping Zhang 004; Teresa W. Haynes; Michael A. Henning; Fred R. McMorris; Robert C. Brigham (Handbook of Graph Theory, 2003)

On connected resolvability of graphs. - Varaporn Saenpholphat; Ping Zhang 004 (Australas. J Comb., 2003)

Nonplanar Sequences of Iterated r-Jump Graphs. - Gary Chartrand; Ping Zhang 004 (Ars Comb., 2003)

Connected Resolving Sets in Graphs. - Varaporn Saenpholphat; Ping Zhang 004 (Ars Comb., 2003)

Graphs of order n with locating-chromatic number n-1. - Gary Chartrand; David Erwin; Michael A. Henning; Peter J. Slater; Ping Zhang 004 (Discret. Math., 2003)

Boundary vertices in graphs. - Gary Chartrand; David Erwin; Garry L. Johns; Ping Zhang 004 (Discret. Math., 2003)

Stratification and domination in graphs. - Gary Chartrand; Teresa W. Haynes; Michael A. Henning; Ping Zhang 004 (Discret. Math., 2003)

Greedy F-colorings of graphs. - Gary Chartrand; Ladislav Nebesky; Ping Zhang 004 (Discret. Math., 2003)

On k-dimensional graphs and their bases. - Peter S. Buczkowski; Gary Chartrand; Christopher Poisson; Ping Zhang 004 (Period. Math. Hung., 2003)

Detour Domination in Graphs. - Gary Chartrand; Teresa W. Haynes; Michael A. Henning; Ping Zhang 004 (Ars Comb., 2004)

On the Detour Number and Geodetic Number of a Graph. - Gary Chartrand; Garry L. Johns; Ping Zhang 004 (Ars Comb., 2004)

On Resolving Acyclic Partitions of Graphs. - Varaporn Saenpholphat; Ping Zhang 004 (Ars Comb., 2004)

Radio k-colorings of paths. - Gary Chartrand; Ladislav Nebesky; Ping Zhang 004 (Discuss. Math. Graph Theory, 2004)

Conditional resolvability in graphs: a survey. - Varaporn Saenpholphat; Ping Zhang 004 (Int. J. Math. Math. Sci., 2004)

Resolving Edge Colorings in Graphs. - Gary Chartrand; Varaporn Saenpholphat; Ping Zhang 004 (Ars Comb., 2005)

Hamiltonian colorings of graphs. - Gary Chartrand; Ladislav Nebesky; Ping Zhang 004 (Discret. Appl. Math., 2005)

On the dimension of trees. - Robert C. Brigham; Gary Chartrand; Ronald D. Dutton; Ping Zhang 004 (Discret. Math., 2005)

On γ-labelings of trees. - Gary Chartrand; David Erwin; Donald W. VanderJagt; Ping Zhang 004 (Discuss. Math. Graph Theory, 2005)

Uniformly cordial graphs. - Gary Chartrand; Sin-Min Lee; Ping Zhang 004 (Discret. Math., 2006)

On stratification and domination in graphs. - Ralucca Gera; Ping Zhang 004 (Discuss. Math. Graph Theory, 2006)

Distance defined by spanning trees in graphs. - Gary Chartrand; Ladislav Nebesky; Ping Zhang 004 (Discuss. Math. Graph Theory, 2007)

Extremal problems on detectable colorings of trees. - Henry Escuadro; Ping Zhang 004 (Discret. Math., 2008)

Recognizable colorings of graphs. - Gary Chartrand; Linda M. Lesniak; Donald W. VanderJagt; Ping Zhang 004 (Discuss. Math. Graph Theory, 2008)

The metric chromatic number of a graph. - Gary Chartrand; Futaba Okamoto; Ping Zhang 004 (Australas. J Comb., 2009)

A dedication to Professor Gary Chartrand. - Teresa W. Haynes; Michael A. Henning; Ping Zhang 004 (Discret. Math., 2009)

A survey of stratified domination in graphs. - Teresa W. Haynes; Michael A. Henning; Ping Zhang 004 (Discret. Math., 2009)

The set chromatic number of a graph. - Gary Chartrand; Futaba Okamoto; Craig W. Rasmussen; Ping Zhang 004 (Discuss. Math. Graph Theory, 2009)

A sufficient condition for pancyclic graphs. - Kewen Zhao; Yue Lin; Ping Zhang 004 (Inf. Process. Lett., 2009)

The rainbow connectivity of a graph. - Gary Chartrand; Garry L. Johns; Kathleen A. McKeon; Ping Zhang 004 (Networks, 2009)

On multiset colorings of graphs. - Futaba Okamoto; Ebrahim Salehi; Ping Zhang 004 (Discuss. Math. Graph Theory, 2010)

The Sigma Chromatic Number of a Graph. - Gary Chartrand; Futaba Okamoto; Ping Zhang 004 (Graphs Comb., 2010)

Rainbow trees in graphs and generalized connectivity. - Gary Chartrand; Futaba Okamoto; Ping Zhang 004 (Networks, 2010)

The γ-Spectrum of a Graph. - Carlos M. da Fonseca; Varaporn Saenpholphat; Ping Zhang 004 (Ars Comb., 2011)

The Rainbow Connectivities of Small Cubic Graphs. - Garry L. Johns; Futaba Okamoto; Ping Zhang 004 (Ars Comb., 2012)

Vertex rainbow colorings of graphs. - Futaba Fujie-Okamoto; Kyle Kolasinski; Jianwei Lin; Ping Zhang 004 (Discuss. Math. Graph Theory, 2012)

Hamiltonian-colored powers of strong digraphs. - Garry L. Johns; Ryan C. Jones; Kyle Kolasinski; Ping Zhang 004 (Discuss. Math. Graph Theory, 2012)

Nowhere-zero modular edge-graceful graphs. - Ryan C. Jones; Ping Zhang 004 (Discuss. Math. Graph Theory, 2012)

On closed modular colorings of trees. - Bryan Phinezy; Ping Zhang 004 (Discuss. Math. Graph Theory, 2013)

On Modular Edge-Graceful Graphs. - Futaba Fujie-Okamoto; Ryan C. Jones; Kyle Kolasinski; Ping Zhang 004 (Graphs Comb., 2013)

A cycle decomposition conjecture for Eulerian graphs. - Gary Chartrand; Heather Jordan; Ping Zhang 004 (Australas. J Comb., 2014)

On twin edge colorings of graphs. - Eric Andrews; Laars Helenius; Daniel Johnston; Jonathon VerWys; Ping Zhang 004 (Discuss. Math. Graph Theory, 2014)

On Eulerian irregularity in graphs. - Eric Andrews; Chira Lumduanhom; Ping Zhang 004 (Discuss. Math. Graph Theory, 2014)

On k-path pancyclic graphs. - Zhenming Bi; Ping Zhang 004 (Discuss. Math. Graph Theory, 2015)

Characterizations of graphs having large proper connection numbers. - Elliot Laforge; Chira Lumduanhom; Ping Zhang 004 (Discuss. Math. Graph Theory, 2016)

Proper Hamiltonian-Connected Graphs. - Zhenming Bi; Alexis Byers; Ping Zhang 004 (Bull. ICA, 2017)

Kaleidoscopic colorings of graphs. - Gary Chartrand; Sean English; Ping Zhang 004 (Discuss. Math. Graph Theory, 2017)

Stars and Their k-Ramsey Numbers. - Eric Andrews; Gary Chartrand; Chira Lumduanhom; Ping Zhang 004 (Graphs Comb., 2017)

On the connectedness of 3-line graphs. - Khawlah H. Alhulwah; Garry L. Johns; Ping Zhang 004 (Australas. J Comb., 2018)

On k-Ramsey Numbers of Unicyclic-Star Graphs. - Daniel Johnston; Chira Lumduanhom; Ping Zhang 004 (Ars Comb., 2018)

Schwenk graphs of cages. - Khawlah H. Alhulwah; Zhenming Bi; Alexis Byers; Mohra Zayed; Ping Zhang 004 (Bull. ICA, 2018)

Another view of bipartite Ramsey numbers. - Zhenming Bi; Gary Chartrand; Ping Zhang 004 (Discuss. Math. Graph Theory, 2018)

Rainbow disconnection in graphs. - Gary Chartrand; Stephen Devereaux; Teresa W. Haynes; Stephen T. Hedetniemi; Ping Zhang 004 (Discuss. Math. Graph Theory, 2018)

Ramsey sequences of graphs. - Gary Chartrand; Ping Zhang 004 (AKCE Int. J. Graphs Comb., 2020)

Rainbow mean colorings of bipartite graphs. - James Hallas; Ebrahim Salehi; Ping Zhang 004 (Bull. ICA, 2020)

Regular dominating functions in regular graphs. - James Hallas; Maria Talanda-Fisher; Ping Zhang 004 (Bull. ICA, 2020)

Dominating functions in graphs - regularity versus irregularity. - James Hallas; Maria Talanda-Fisher; Ping Zhang 004 (Int. J. Comput. Math. Comput. Syst. Theory, 2020)

Uniformly Connected Graphs - A Survey. - Gary Chartrand; Ping Zhang 004 (Parallel Process. Lett., 2020)

Distance Vertex Identification in Graphs. - Gary Chartrand; Yuya Kono; Ping Zhang 004 (J. Interconnect. Networks, 2021)

Irregular orbital domination in graphs. - Peter Broe; Gary Chartrand; Ping Zhang 004 (Int. J. Comput. Math. Comput. Syst. Theory, 2022)

Vertex Identification in Grids and Prisms. - Yuya Kono; Ping Zhang 004 (J. Interconnect. Networks, 2022)

The Ascending Ramsey Index of a Graph. - Gary Chartrand; Ping Zhang 004 (Symmetry, 2023)

Royal Colorings of Graphs. - Gary Chartrand; James Hallas; Ping Zhang 004 (Ars Comb., 2023)

Ramsey Chains in Linear Forests. - Gary Chartrand; Ritabrato Chatterjee; Ping Zhang 004 (Axioms, 2023)

On subset labelings of trees. - Gary Chartrand; Ebrahim Salehi; Ping Zhang 004 (AKCE Int. J. Graphs Comb., 2024)

On link-irregular graphs. - Akbar Ali; Gary Chartrand; Ping Zhang 004 (Discuss. Math. Graph Theory, 2025)