John Mitchem

Publication Activity (10 Years)

Years Active: 1973-2010
Publications (10 Years): 0

Publications

John Mitchem, Randolph L. Schmidt
On the Erdos-Faber-Lovasz Conjecture. Ars Comb. 97 (2010)
John Mitchem, Edward F. Schmeichel
The Harmonious Chromatic Number of Deep and Wide Complete n- ary Trees. Electron. Notes Discret. Math. 11 (2002)
S. Louis Hakimi, John Mitchem, Edward F. Schmeichel
Short Proofs of Theorems of Nash-Williams and Tutte. Ars Comb. 50 (1998)
John Mitchem, Patrick Morriss
On the cost-chromatic number of graphs. Discret. Math. 171 (1-3) (1997)
John Mitchem, Patrick Morriss, Edward F. Schmeichel
On the cost chromatic number of outerplanar, planar, and line graphs. Discuss. Math. Graph Theory 17 (2) (1997)
S. Louis Hakimi, John Mitchem, Edward F. Schmeichel
Star arboricity of graphs. Discret. Math. 149 (1-3) (1996)
S. Louis Hakimi, John Mitchem, Edward F. Schmeichel
Degree-bounded coloring of graphs: Variations on a theme by brooks. J. Graph Theory 20 (2) (1995)
Anindo Bagchi, S. Louis Hakimi, John Mitchem, Edward F. Schmeichel
Parallel Algorithms for Gossiping by Mail. Inf. Process. Lett. 34 (4) (1990)
John Mitchem
On the harmonious chromatic number of a graph. Discret. Math. 74 (1-2) (1989)
Sin-Min Lee, John Mitchem
An upper bound for the harmonious chromatic number of a graph. J. Graph Theory 11 (4) (1987)
Edward F. Schmeichel, John Mitchem
Bipartite graphs with cycles of all even lengths. J. Graph Theory 6 (4) (1982)
John Mitchem
A short proof of Catlin's extension of Brooks' theorem. Discret. Math. 21 (2) (1978)
John Mitchem
An extension of Brooks' theorem to n-degenerate graphs. Discret. Math. 17 (3) (1977)
John Mitchem
On Various Algorithms for Estimating the Chromatic Number of a Graph. Comput. J. 19 (2) (1976)
Arthur M. Hobbs, John Mitchem
The entire graph of a bridgeless connected plane graph is hamiltonian. Discret. Math. 16 (3) (1976)
Hudson V. Kronk, John Mitchem
A seven-color theorem on the sphere. Discret. Math. 5 (3) (1973)