Notice: Unexpected clearActionName after getActionName already called in /var/www/html/w/includes/context/RequestContext.php on line 333
Nathaniel Dean - MaRDI portal

Nathaniel Dean

From MaRDI portal
(Redirected from Person:1204478)
Person:918992

Available identifiers

zbMath Open dean.nathanielMaRDI QIDQ918992

List of research outcomes





PublicationDate of PublicationType
https://portal.mardi4nfdi.de/entity/Q53841752019-06-21Paper
Coprime and prime labelings of graphs2016-07-05Paper
Iteration Index of a Zero Forcing Set in a Graph2012-09-07Paper
https://portal.mardi4nfdi.de/entity/Q35658942010-06-07Paper
https://portal.mardi4nfdi.de/entity/Q54779682006-06-29Paper
LINK: a system for graph computation2003-01-23Paper
Gallai's conjecture for disconnected graphs2000-08-28Paper
https://portal.mardi4nfdi.de/entity/Q38382081998-10-25Paper
https://portal.mardi4nfdi.de/entity/Q43933521998-08-04Paper
https://portal.mardi4nfdi.de/entity/Q43528271997-09-04Paper
https://portal.mardi4nfdi.de/entity/Q52840701997-05-19Paper
https://portal.mardi4nfdi.de/entity/Q48946191996-11-25Paper
https://portal.mardi4nfdi.de/entity/Q48711481996-08-18Paper
https://portal.mardi4nfdi.de/entity/Q48738141996-04-22Paper
The Ulam number of infinite graphs1996-02-12Paper
NETPAD: An interactive graphics system for network modeling and optimization1996-01-07Paper
https://portal.mardi4nfdi.de/entity/Q47633251995-04-11Paper
https://portal.mardi4nfdi.de/entity/Q47633301995-04-11Paper
https://portal.mardi4nfdi.de/entity/Q43019151994-11-27Paper
https://portal.mardi4nfdi.de/entity/Q42738781994-06-12Paper
Cycles of length 0 modulo 4 in graphs1994-06-08Paper
Well-covered graphs and extendability1994-04-04Paper
https://portal.mardi4nfdi.de/entity/Q42738561994-01-06Paper
Bounds for rectilinear crossing numbers1993-08-24Paper
On obstructions to small face covers in planar graphs1993-03-10Paper
New results on rectilinear crossing numbers and plane embeddings1993-01-17Paper
The matching extendability of surfaces1991-01-01Paper
Distribution of contractible edges in k-connected graphs1990-01-01Paper
Longest cycles in 3-connected graphs contain three contractible edges1989-01-01Paper
A degree condition for the circumference of a graph1989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38161061988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38190881988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38221961988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37817831987-01-01Paper
What is the smallest number of dicycles in a dicycle decomposition of an eulerian digraph?1986-01-01Paper

Research outcomes over time

This page was built for person: Nathaniel Dean