Earl Glen Whitehead, Jr.
PhD, University of Southern California
Asociate Professor
Graph theory, algorithms, and mathematical chemistry

Thackeray 601.     Tel: 412-624-8357
Email: egw1@pitt.edu

Personal home page

My graph theory research is primarily focused on graph polynomials. For example, the chromatic polynomial counts the number of proper vertex-colorings of a graph. I am interested in combinatorial algorithms. I use these algorithms to solve problems and to generate examples. My mathematical chemistry research uses graph theoretical quantities to model physical properties of chemical molecules.
Three recent publications:

• R. C. Read and E. G. Whitehead, Jr., The Tutte polynomial for homeomorphism classes of graphs, Discrete Math. 243 (2002) 267-272.
• R. C. Read and E. G. Whitehead, Jr., Chromatic polynomials for homeomorphism classes of graphs, Discrete Math. 204 (1999) 337-356.
• Z.-Y. Guo and E. G. Whitehead, Jr., Chromaticity of a family of K4 homeomorphs, Discrete Math. 172 (1997), 53-58.

Graduate students:     Sr. Marcella Wallowicz.

People in Graph Theory: Directory
The Math Genealogy Project
History of Math: mathematicians