John Mitchem

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