Stanley M. Selkow

Publication Activity (10 Years)

Years Active: 1972-2015
Publications (10 Years): 1

Top Topics

Complex Structures

Difficult Problems

Connected Subgraphs

Top Venues

J. Graph Theory

Publications

András Gyárfás, Gábor N. Sárközy, Stanley M. Selkow
Coverings by Few Monochromatic Pieces: A Transition Between Two Ramsey Problems. Graphs Comb. 31 (1) (2015)
Gábor N. Sárközy, Stanley M. Selkow, Fei Song
An Improved Bound for Vertex Partitions by Connected Monochromatic K-Regular Graphs. J. Graph Theory 73 (2) (2013)
Gábor N. Sárközy, Stanley M. Selkow, Fei Song
Vertex partitions of non-complete graphs into connected monochromatic k-regular graphs. Discret. Math. 311 (18-19) (2011)
András Gyárfás, Gábor N. Sárközy, András Sebö, Stanley M. Selkow
Ramsey-type results for Gallai colorings. J. Graph Theory 64 (3) (2010)
Zoltán Füredi, András Gyárfás, Gábor N. Sárközy, Stanley M. Selkow
Inequalities for the first-fit chromatic number. J. Graph Theory 59 (1) (2008)
Gábor N. Sárközy, Stanley M. Selkow
Distributing vertices along a Hamiltonian cycle in Dirac graphs. Discret. Math. 308 (23) (2008)
Gábor N. Sárközy, Stanley M. Selkow
On an anti-Ramsey problem of Burr, Erdös, Graham, and T. Sós. J. Graph Theory 52 (2) (2006)
Gábor N. Sárközy, Stanley M. Selkow
On a Turán-type hypergraph problem of Brown, Erdos and T. Sós. Discret. Math. 297 (1-3) (2005)
Daniel J. Dougherty, Stanley M. Selkow
The complexity of the certification of properties of Stable Marriage. Inf. Process. Lett. 92 (6) (2004)
Gábor N. Sárközy, Stanley M. Selkow
An Extension Of The Ruzsa-Szemerédi Theorem. Comb. 25 (1) (2004)
Gábor N. Sárközy, Stanley M. Selkow
An application of the regularity lemma in generalized Ramsey theory. J. Graph Theory 44 (1) (2003)
Gábor N. Sárközy, Stanley M. Selkow, Endre Szemerédi
On the number of Hamiltonian cycles in Dirac graphs. Discret. Math. 265 (1-3) (2003)
Gábor N. Sárközy, Stanley M. Selkow
On bipartite generalized Ramsey theory. Ars Comb. 68 (2003)
Gábor N. Sárközy, Stanley M. Selkow
On Edge Colorings with at Least q Colors in Every Subset of p Vertices. Electron. J. Comb. 8 (1) (2001)
Gábor N. Sárközy, Stanley M. Selkow
Vertex Partitions by Connected Monochromatic k-Regular Graphs. J. Comb. Theory, Ser. B 78 (1) (2000)
Hal A. Kierstead, Gábor N. Sárközy, Stanley M. Selkow
-ordered Hamiltonian graphs. J. Graph Theory 32 (1) (1999)
Aron C. Atkins, Gábor N. Sárközy, Stanley M. Selkow
Counting irregular multigraphs. Discret. Math. 195 (1-3) (1999)
Stanley M. Selkow
The enumeration of labeled graphs by number of cutpoints. Discret. Math. 185 (1-3) (1998)
Steve Taylor, Nabil I. Hachem, Stanley M. Selkow
The Average Height of a Node in the BANG Abstract Directory Tree. Inf. Process. Lett. 61 (1) (1997)
Claude A. Christen, Giovanni Coray, Stanley M. Selkow
A characterization of n-component graphs. Discret. Math. 149 (1-3) (1996)
Stanley M. Selkow
A Probabilistic lower bound on the independence number of graphs. Discret. Math. 132 (1-3) (1994)
Stanley M. Selkow
The independence number of graphs in terms of degrees. Discret. Math. 122 (1-3) (1993)
O. J. Murphy, Stanley M. Selkow
Finding Nearest Neighbors with Voronoi Tessellations. Inf. Process. Lett. 34 (1) (1990)
O. J. Murphy, Stanley M. Selkow
The Efficiency of Using k-d Trees for Finding Nearest Neighbors in Discrete Space. Inf. Process. Lett. 23 (4) (1986)
Charles E. Hughes, Stanley M. Selkow
The Finite Power Property for Context-Free Languages. Theor. Comput. Sci. 15 (1981)
László Babai, Paul Erdös, Stanley M. Selkow
Random Graph Isomorphism. SIAM J. Comput. 9 (3) (1980)
Claude A. Christen, Stanley M. Selkow
Some perfect coloring properties of graphs. J. Comb. Theory, Ser. B 27 (1) (1979)
Stanley M. Selkow
New Bounds for the Clique Number of a Graph. Inf. Process. Lett. 7 (4) (1978)
Stanley M. Selkow
The Tree-to-Tree Editing Problem. Inf. Process. Lett. 6 (6) (1977)
Stanley M. Selkow
Diagnostic Keys as a Representation for Context in Pattern Recognition. IEEE Trans. Computers 23 (9) (1974)
Ludwig Nastansky, Stanley M. Selkow, Neil F. Stewart
Cost-minimal trees in directed acyclic graphs. Z. Oper. Research 18 (1) (1974)
Stanley M. Selkow
One-Pass Complexity of Digital Picture Properties. J. ACM 19 (2) (1972)