John Mitchem

发表

Short Proofs of Theorems of Nash-Williams and Tutte

S. Louis Hakimi, Edward F. Schmeichel, John Mitchem, 1998, Ars Comb..

On the cost-chromatic number of graphs

John Mitchem, Patrick Morriss, 1997, Discret. Math..

A short proof of Catlin's extension of Brooks' theorem

John Mitchem, 1978, Discret. Math..

The Harmonious Chromatic Number of Deep and Wide Complete n- ary Trees

Edward F. Schmeichel, John Mitchem, 2002, Electron. Notes Discret. Math..

On Various Algorithms for Estimating the Chromatic Number of a Graph

John Mitchem, J. Mitchem, 1976, Comput. J..

A seven-color theorem on the sphere

John Mitchem, Hudson V. Kronk, 1973, Discret. Math..

Bipartite graphs with cycles of all even lengths

Edward F. Schmeichel, John Mitchem, 1982, J. Graph Theory.

Star arboricity of graphs

S. Louis Hakimi, Edward F. Schmeichel, John Mitchem, 1996, Discret. Math..

An upper bound for the harmonious chromatic number of a graph

John Mitchem, Sin-Min Lee, 1987, J. Graph Theory.

The entire graph of a bridgeless connected plane graph is hamiltonian

Arthur M. Hobbs, John Mitchem, 1976, Discret. Math..

An extension of Brooks' theorem to n-degenerate graphs

John Mitchem, 1977, Discret. Math..

On the Erdos-Faber-Lovasz Conjecture

John Mitchem, Randolph L. Schmidt, 2010, Ars Comb..

On the harmonious chromatic number of a graph

John Mitchem, 1989, Discret. Math..

Degree-bounded coloring of graphs: Variations on a theme by brooks

S. Louis Hakimi, Edward F. Schmeichel, John Mitchem, 1995, J. Graph Theory.

Parallel Algorithms for Gossiping by Mail

S. Louis Hakimi, Edward F. Schmeichel, Anindo Bagchi, 1990, Inf. Process. Lett..

On the cost chromatic number of outerplanar, planar, and line graphs

Edward F. Schmeichel, John Mitchem, Patrick Morriss, 1997, Discuss. Math. Graph Theory.

Uniquelyk-arborable graphs

John Mitchem, 1971 .

Critical Point‐Arboritic Graphs

John Mitchem, Hudson V. Kronk, J. Mitchem, 1975 .

On Dirac's Generalization of Brooks' Theorem

John Mitchem, Hudson V. Kronk, J. Mitchem, 1972, Canadian Journal of Mathematics.

The connectivity and line-connectivity of complementary graphs

Yousef Alavi, John Mitchem, Y. Alavi, 1971 .

Graphical theorems of the Nordhaus-Gaddum class

Gary Chartrand, John Mitchem, G. Chartrand, 1971 .

The entire chromatic number of a normal graph is at most seven

John Mitchem, Hudson V. Kronk, 1972 .

On the point-arboricity of a graph and its complement

John Mitchem, 1971 .

A new proof of a theorem of Dirac on the number of edges in critical graphs.

John Mitchem, 1978 .

Hamiltonian and Eulerian properties of entire graphs

John Mitchem, 1972 .

Hypo-properties in graphs

John Mitchem, 1969 .