Stanley M. Selkow

Available identifiers

zbMath Open selkow.stanley-mWikidataQ102306082 ScholiaQ102306082MaRDI QIDQ641169

List of research outcomes

Publication	Date of Publication	Type
Coverings by few monochromatic pieces: a transition between two Ramsey problems	2015-01-20	Paper
An Improved Bound for Vertex Partitions by Connected Monochromatic K-Regular Graphs	2013-05-21	Paper
Vertex partitions of non-complete graphs into connected monochromatic \(k\)-regular graphs	2011-10-21	Paper
Ramsey-type results for Gallai colorings	2010-11-10	Paper
The complexity of the certification of properties of stable marriage	2009-08-27	Paper
Distributing vertices along a Hamiltonian cycle in Dirac graphs	2009-01-28	Paper
Inequalities for the first-fit chromatic number	2008-10-08	Paper
On an anti‐Ramsey problem of Burr, Erdős, Graham, and T. Sós	2006-06-06	Paper
On a Turán-type hypergraph problem of Brown, Erdős and T. Sós	2005-09-22	Paper
https://portal.mardi4nfdi.de/entity/Q5466073	2005-08-23	Paper
An extension of the Ruzsa-Szemerédi theorem	2005-07-05	Paper
An application of the regularity lemma in generalized Ramsey theory	2003-11-10	Paper
On the number of Hamiltonian cycles in Dirac graphs	2003-05-25	Paper
On edge colorings with at least \(q\) colors in every subset of \(p\) vertices	2001-02-08	Paper
The enumeration of labeled graphs by number of cutpoints	2000-11-02	Paper
Vertex partitions by connected monochromatic \(k\)-regular graphs	2000-06-25	Paper
Counting irregular multigraphs	2000-02-27	Paper
https://portal.mardi4nfdi.de/entity/Q4265584	1999-11-23	Paper
A characterization of \(n\)-component graphs	1996-03-25	Paper
A probabilistic lower bound on the independence number of graphs	1995-04-09	Paper
The independence number of graphs in terms of degrees	1994-06-28	Paper
Finding nearest neighbors with Voronoi tessellations	1990-01-01	Paper
The efficiency of using k-d trees for finding nearest neighbors in discrete space	1986-01-01	Paper
The finite power property for context-free languages	1981-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3900073	1981-01-01	Paper
Random Graph Isomorphism	1980-01-01	Paper
Some perfect coloring properties of graphs	1979-01-01	Paper
New bounds for the clique number of a graph	1978-01-01	Paper
The tree-to-tree editing problem	1977-01-01	Paper
Diagnostic Keys as a Representation for Context in Pattern Recognition	1974-01-01	Paper
Cost-minimal trees in directed acyclic graphs	1974-01-01	Paper
The enumeration of minimal phylograms	1973-01-01	Paper
One-Pass Complexity of Digital Picture Properties	1972-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: Stanley M. Selkow