default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJohn Mitchem
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2010
[j16]John Mitchem, Randolph L. Schmidt:
On the Erdos-Faber-Lovasz Conjecture. Ars Comb. 97 (2010)
2000 – 2009
- 2002
- [j15]John Mitchem, Edward F. Schmeichel:
The Harmonious Chromatic Number of Deep and Wide Complete n- ary Trees. Electron. Notes Discret. Math. 11: 491-502 (2002)
1990 – 1999
- 1998
- [j14]S. Louis Hakimi, John Mitchem, Edward F. Schmeichel:
Short Proofs of Theorems of Nash-Williams and Tutte. Ars Comb. 50 (1998) - 1997
- [j13]John Mitchem, Patrick Morriss:
On the cost-chromatic number of graphs. Discret. Math. 171(1-3): 201-211 (1997) - [j12]John Mitchem, Patrick Morriss, Edward F. Schmeichel:
On the cost chromatic number of outerplanar, planar, and line graphs. Discuss. Math. Graph Theory 17(2): 229-241 (1997) - 1996
- [j11]S. Louis Hakimi, John Mitchem, Edward F. Schmeichel:
Star arboricity of graphs. Discret. Math. 149(1-3): 93-98 (1996) - 1995
- [j10]S. Louis Hakimi, John Mitchem, Edward F. Schmeichel:
Degree-bounded coloring of graphs: Variations on a theme by brooks. J. Graph Theory 20(2): 177-194 (1995) - 1990
- [j9]Anindo Bagchi, S. Louis Hakimi, John Mitchem, Edward F. Schmeichel:
Parallel Algorithms for Gossiping by Mail. Inf. Process. Lett. 34(4): 197-202 (1990)
1980 – 1989
- 1989
- [j8]John Mitchem:
On the harmonious chromatic number of a graph. Discret. Math. 74(1-2): 151-157 (1989) - 1987
- [j7]Sin-Min Lee, John Mitchem:
An upper bound for the harmonious chromatic number of a graph. J. Graph Theory 11(4): 565-567 (1987) - 1982
- [j6]Edward F. Schmeichel, John Mitchem:
Bipartite graphs with cycles of all even lengths. J. Graph Theory 6(4): 429-439 (1982)
1970 – 1979
- 1978
- [j5]John Mitchem:
A short proof of Catlin's extension of Brooks' theorem. Discret. Math. 21(2): 213-214 (1978) - 1977
- [j4]John Mitchem:
An extension of Brooks' theorem to n-degenerate graphs. Discret. Math. 17(3): 291-298 (1977) - 1976
- [j3]John Mitchem:
On Various Algorithms for Estimating the Chromatic Number of a Graph. Comput. J. 19(2): 182-183 (1976) - [j2]Arthur M. Hobbs, John Mitchem:
The entire graph of a bridgeless connected plane graph is hamiltonian. Discret. Math. 16(3): 233-239 (1976) - 1973
- [j1]Hudson V. Kronk, John Mitchem:
A seven-color theorem on the sphere. Discret. Math. 5(3): 253-260 (1973)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:55 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
