Nathaniel Dean

Available identifiers

zbMath Open dean.nathanielMaRDI QIDQ918992

List of research outcomes

Publication	Date of Publication	Type
https://portal.mardi4nfdi.de/entity/Q5384175	2019-06-21	Paper
Coprime and prime labelings of graphs	2016-07-05	Paper
Iteration Index of a Zero Forcing Set in a Graph	2012-09-07	Paper
https://portal.mardi4nfdi.de/entity/Q3565894	2010-06-07	Paper
https://portal.mardi4nfdi.de/entity/Q5477968	2006-06-29	Paper
https://portal.mardi4nfdi.de/entity/Q4789077	2003-01-23	Paper
Gallai's conjecture for disconnected graphs	2000-08-28	Paper
https://portal.mardi4nfdi.de/entity/Q3838208	1998-10-25	Paper
https://portal.mardi4nfdi.de/entity/Q4393352	1998-08-04	Paper
https://portal.mardi4nfdi.de/entity/Q4352827	1997-09-04	Paper
https://portal.mardi4nfdi.de/entity/Q5284070	1997-05-19	Paper
https://portal.mardi4nfdi.de/entity/Q4894619	1996-11-25	Paper
https://portal.mardi4nfdi.de/entity/Q4871148	1996-08-18	Paper
https://portal.mardi4nfdi.de/entity/Q4873814	1996-04-22	Paper
The Ulam number of infinite graphs	1996-02-12	Paper
NETPAD: An interactive graphics system for network modeling and optimization	1996-01-07	Paper
https://portal.mardi4nfdi.de/entity/Q4763325	1995-04-11	Paper
https://portal.mardi4nfdi.de/entity/Q4763330	1995-04-11	Paper
https://portal.mardi4nfdi.de/entity/Q4301915	1994-11-27	Paper
https://portal.mardi4nfdi.de/entity/Q4273878	1994-06-12	Paper
Cycles of length 0 modulo 4 in graphs	1994-06-08	Paper
Well-covered graphs and extendability	1994-04-04	Paper
https://portal.mardi4nfdi.de/entity/Q4273856	1994-01-06	Paper
Bounds for rectilinear crossing numbers	1993-08-24	Paper
On obstructions to small face covers in planar graphs	1993-03-10	Paper
New results on rectilinear crossing numbers and plane embeddings	1993-01-17	Paper
The matching extendability of surfaces	1991-01-01	Paper
Distribution of contractible edges in k-connected graphs	1990-01-01	Paper
Longest cycles in 3-connected graphs contain three contractible edges	1989-01-01	Paper
A degree condition for the circumference of a graph	1989-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3816106	1988-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3819088	1988-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3822196	1988-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3781783	1987-01-01	Paper
What is the smallest number of dicycles in a dicycle decomposition of an eulerian digraph?	1986-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: Nathaniel Dean