Stanley M. Selkow

According to our database, Stanley M. Selkow authored at least 33 papers between 1972 and 2015.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of one.

2015

Coverings by Few Monochromatic Pieces: A Transition Between Two Ramsey Problems.

András Gyárfás, Gábor N. Sárközy, Stanley M. Selkow

Graphs Comb., 2015

2013

An Improved Bound for Vertex Partitions by Connected Monochromatic K-Regular Graphs.

Gábor N. Sárközy, Stanley M. Selkow, Fei Song

J. Graph Theory, 2013

2011

Vertex partitions of non-complete graphs into connected monochromatic k-regular graphs.

Gábor N. Sárközy, Stanley M. Selkow, Fei Song

Discret. Math., 2011

2010

Ramsey-type results for Gallai colorings.

András Gyárfás, Gábor N. Sárközy, András Sebö, Stanley M. Selkow

J. Graph Theory, 2010

2009

Algorithms in a nutshell - a desktop quick reference.

George T. Heineman, Gary Pollice, Stanley M. Selkow

O'Reilly, ISBN: 978-0-596-51624-6, 2009

2008

Inequalities for the first-fit chromatic number.

Zoltán Füredi, András Gyárfás, Gábor N. Sárközy, Stanley M. Selkow

J. Graph Theory, 2008

Distributing vertices along a Hamiltonian cycle in Dirac graphs.

Gábor N. Sárközy, Stanley M. Selkow

Discret. Math., 2008

2006

On an anti-Ramsey problem of Burr, Erdös, Graham, and T. Sós.

Gábor N. Sárközy, Stanley M. Selkow

J. Graph Theory, 2006

2005

On a Turán-type hypergraph problem of Brown, Erdos and T. Sós.

Gábor N. Sárközy, Stanley M. Selkow

Discret. Math., 2005

2004

The complexity of the certification of properties of Stable Marriage.

Daniel J. Dougherty, Stanley M. Selkow

Inf. Process. Lett., 2004

An Extension Of The Ruzsa-Szemerédi Theorem.

Gábor N. Sárközy, Stanley M. Selkow

Comb., 2004

2003

An application of the regularity lemma in generalized Ramsey theory.

Gábor N. Sárközy, Stanley M. Selkow

J. Graph Theory, 2003

On the number of Hamiltonian cycles in Dirac graphs.

Gábor N. Sárközy, Stanley M. Selkow, Endre Szemerédi

Discret. Math., 2003

On bipartite generalized Ramsey theory.

Gábor N. Sárközy, Stanley M. Selkow

Ars Comb., 2003

2001

On Edge Colorings with at Least q Colors in Every Subset of p Vertices.

Gábor N. Sárközy, Stanley M. Selkow

Electron. J. Comb., 2001

2000

Vertex Partitions by Connected Monochromatic k-Regular Graphs.

Gábor N. Sárközy, Stanley M. Selkow

J. Comb. Theory B, 2000

1999

On <i>k</i>-ordered Hamiltonian graphs.

Hal A. Kierstead, Gábor N. Sárközy, Stanley M. Selkow

J. Graph Theory, 1999

Counting irregular multigraphs.

Aron C. Atkins, Gábor N. Sárközy, Stanley M. Selkow

Discret. Math., 1999

1998

The enumeration of labeled graphs by number of cutpoints.

Stanley M. Selkow

Discret. Math., 1998

1997

The Average Height of a Node in the BANG Abstract Directory Tree.

Steve Taylor, Nabil I. Hachem, Stanley M. Selkow

Inf. Process. Lett., 1997

1996

A characterization of n-component graphs.

Claude A. Christen, Giovanni Coray, Stanley M. Selkow

Discret. Math., 1996

1994

A Probabilistic lower bound on the independence number of graphs.

Stanley M. Selkow

Discret. Math., 1994

1993

The independence number of graphs in terms of degrees.

Stanley M. Selkow

Discret. Math., 1993

1990

Finding Nearest Neighbors with Voronoi Tessellations.

O. J. Murphy, Stanley M. Selkow

Inf. Process. Lett., 1990

1986

The Efficiency of Using k-d Trees for Finding Nearest Neighbors in Discrete Space.

O. J. Murphy, Stanley M. Selkow

Inf. Process. Lett., 1986

1981

The Finite Power Property for Context-Free Languages.

Charles E. Hughes, Stanley M. Selkow

Theor. Comput. Sci., 1981

1980

Random Graph Isomorphism.

László Babai, Paul Erdös, Stanley M. Selkow

SIAM J. Comput., 1980

1979

Some perfect coloring properties of graphs.

Claude A. Christen, Stanley M. Selkow

J. Comb. Theory B, 1979

1978

New Bounds for the Clique Number of a Graph.

Stanley M. Selkow

Inf. Process. Lett., 1978

1977

The Tree-to-Tree Editing Problem.

Stanley M. Selkow

Inf. Process. Lett., 1977

1974

Diagnostic Keys as a Representation for Context in Pattern Recognition.

Stanley M. Selkow

IEEE Trans. Computers, 1974

Cost-minimal trees in directed acyclic graphs.

Ludwig Nastansky, Stanley M. Selkow, Neil F. Stewart

Z. Oper. Research, 1974

1972

One-Pass Complexity of Digital Picture Properties.

Stanley M. Selkow

J. ACM, 1972