John Mitchem

According to our database1, John Mitchem authored at least 16 papers between 1973 and 2010.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2010
On the Erdos-Faber-Lovasz Conjecture.
Ars Comb., 2010

2002
The Harmonious Chromatic Number of Deep and Wide Complete n- ary Trees.
Electron. Notes Discret. Math., 2002

1998
Short Proofs of Theorems of Nash-Williams and Tutte.
Ars Comb., 1998

1997
On the cost chromatic number of outerplanar, planar, and line graphs.
Discuss. Math. Graph Theory, 1997

On the cost-chromatic number of graphs.
Discret. Math., 1997

1996
Star arboricity of graphs.
Discret. Math., 1996

1995
Degree-bounded coloring of graphs: Variations on a theme by brooks.
J. Graph Theory, 1995

1990
Parallel Algorithms for Gossiping by Mail.
Inf. Process. Lett., 1990

1989
On the harmonious chromatic number of a graph.
Discret. Math., 1989

1987
An upper bound for the harmonious chromatic number of a graph.
J. Graph Theory, 1987

1982
Bipartite graphs with cycles of all even lengths.
J. Graph Theory, 1982

1978
A short proof of Catlin's extension of Brooks' theorem.
Discret. Math., 1978

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

1976
The entire graph of a bridgeless connected plane graph is hamiltonian.
Discret. Math., 1976

On Various Algorithms for Estimating the Chromatic Number of a Graph.
Comput. J., 1976

1973
A seven-color theorem on the sphere.
Discret. Math., 1973


  Loading...