Abstract: During the past 50 years, a number of problems and puzzles have been introduced that initially appeared to have no connection to graph colorings. However, upon further analysis, all of these suggested graph colorings problems. We look at a few of these.
Biography: Ping Zhang is Professor of Mathematics at Western Michigan University. She received her Ph.D. in mathematics from Michigan State University in 1995. After one year as a Visiting Assistant Professor at the University of Texas El Paso, she went to Western Michigan University in 1996 and has been there since then. Her main research interests are in the areas of algebraic combinatorics and
Ping Zhang has co-authored five books: Mathematical Proofs: A Transition to Advanced Mathematics (third edition in press), Chromatic Graph Theory, Graphs & Digraphs (fifth edition), Discrete Mathematics and A First Course in Graph Theory (new edition of Introduction to Graph Theory). She is currently co-editing the second edition of the Handbook of Graph Theory and co-authoring the book The Fantastic World of Graph Theory.
She has authored or co-authored over 200 research articles in algebraic combinatorics and graph theory and has given over 60 invited or contributed talks at universities and at regional, national and international conferences. She has directed the doctoral dissertations of six students.
Ping Zhang is a council member of the Institute of Combinatorics and Its Applications and an editor of the Springer book series SpringerBriefs in Mathematics.