A seven-color theorem on the sphere. - Hudson V. Kronk; John Mitchem (Discret. Math., 1973)

On Various Algorithms for Estimating the Chromatic Number of a Graph. - John Mitchem (Comput. J., 1976)

The entire graph of a bridgeless connected plane graph is hamiltonian. - Arthur M. Hobbs; John Mitchem (Discret. Math., 1976)

An extension of Brooks' theorem to n-degenerate graphs. - John Mitchem (Discret. Math., 1977)

A short proof of Catlin's extension of Brooks' theorem. - John Mitchem (Discret. Math., 1978)

Bipartite graphs with cycles of all even lengths. - Edward F. Schmeichel; John Mitchem (J. Graph Theory, 1982)

An upper bound for the harmonious chromatic number of a graph. - Sin-Min Lee; John Mitchem (J. Graph Theory, 1987)

On the harmonious chromatic number of a graph. - John Mitchem (Discret. Math., 1989)

Parallel Algorithms for Gossiping by Mail. - Anindo Bagchi; S. Louis Hakimi; John Mitchem; Edward F. Schmeichel (Inf. Process. Lett., 1990)

Degree-bounded coloring of graphs: Variations on a theme by brooks. - S. Louis Hakimi; John Mitchem; Edward F. Schmeichel (J. Graph Theory, 1995)

Star arboricity of graphs. - S. Louis Hakimi; John Mitchem; Edward F. Schmeichel (Discret. Math., 1996)

On the cost-chromatic number of graphs. - John Mitchem; Patrick Morriss (Discret. Math., 1997)

On the cost chromatic number of outerplanar, planar, and line graphs. - John Mitchem; Patrick Morriss; Edward F. Schmeichel (Discuss. Math. Graph Theory, 1997)

Short Proofs of Theorems of Nash-Williams and Tutte. - S. Louis Hakimi; John Mitchem; Edward F. Schmeichel (Ars Comb., 1998)

The Harmonious Chromatic Number of Deep and Wide Complete n- ary Trees. - John Mitchem; Edward F. Schmeichel (Electron. Notes Discret. Math., 2002)

On the Erdos-Faber-Lovasz Conjecture. - John Mitchem; Randolph L. Schmidt (Ars Comb., 2010)