John Mitchem

Available identifiers

zbMath Open mitchem.johnMaRDI QIDQ1171577

List of research outcomes

Publication	Date of Publication	Type
https://portal.mardi4nfdi.de/entity/Q3115038	2012-02-20	Paper
https://portal.mardi4nfdi.de/entity/Q5708601	2005-11-18	Paper
https://portal.mardi4nfdi.de/entity/Q2713657	2001-06-10	Paper
On the cost chromatic number of outerplanar, planar, and line graphs	1998-11-08	Paper
On the cost-chromatic number of graphs	1997-08-10	Paper
https://portal.mardi4nfdi.de/entity/Q4873817	1996-04-22	Paper
https://portal.mardi4nfdi.de/entity/Q4871173	1996-03-28	Paper
Star arboricity of graphs	1996-03-25	Paper
Degree‐bounded coloring of graphs: Variations on a theme by brooks	1995-10-31	Paper
Gale's Round-Trip Jeep Problem	1995-09-17	Paper
https://portal.mardi4nfdi.de/entity/Q4305526	1995-01-26	Paper
https://portal.mardi4nfdi.de/entity/Q4032990	1993-05-18	Paper
https://portal.mardi4nfdi.de/entity/Q4014299	1992-10-06	Paper
https://portal.mardi4nfdi.de/entity/Q3976633	1992-06-26	Paper
Parallel algorithms for gossiping by mail	1990-01-01	Paper
On the harmonious chromatic number of a graph	1989-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3819109	1988-01-01	Paper
An upper bound for the harmonious chromatic number of a graph	1987-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3680866	1985-01-01	Paper
On the acyclic point-connectivity of the n-cube	1982-01-01	Paper
Bipartite graphs with cycles of all even lengths	1982-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3950578	1981-01-01	Paper
A short proof of Catlin's extension of Brooks' theorem	1978-01-01	Paper
A new proof of a theorem of Dirac on the number of edges in critical graphs.	1978-01-01	Paper
On the Genus of Graphs with Lick-White Number k	1978-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4194981	1978-01-01	Paper
An extension of Brooks' theorem to n-degenerate graphs	1977-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4117855	1977-01-01	Paper
The entire graph of a bridgeless connected plane graph is Hamiltonian	1976-01-01	Paper
On Various Algorithms for Estimating the Chromatic Number of a Graph	1976-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4149469	1976-01-01	Paper
Critical Point-Arboritic Graphs	1975-01-01	Paper
Every planar graph has an acyclic 8-coloring	1974-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4041601	1974-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4052169	1974-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4777318	1974-01-01	Paper
A seven-color theorem on the sphere	1973-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q5668493	1973-01-01	Paper
On Dirac's Generalization of Brooks' Theorem	1972-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q5659558	1972-01-01	Paper
The entire chromatic number of a normal graph is at most seven	1972-01-01	Paper
Uniquely k-arborable graphs	1971-01-01	Paper
On the Point-Arboricity of a Graph and its Complement	1971-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q5613121	1971-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q5615290	1971-01-01	Paper
On Graphs with Prescribed Clique Number and Point-Arboricity	1971-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q5578303	1969-01-01	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: John Mitchem