Stanley M. Selkow

发表

The enumeration of labeled graphs by number of cutpoints

Stanley M. Selkow, S. Selkow, 1998, Discret. Math..

Some perfect coloring properties of graphs

Stanley M. Selkow, Claude A. Christen, 1979, J. Comb. Theory, Ser. B.

Distributing vertices along a Hamiltonian cycle in Dirac graphs

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

Cost-minimal trees in directed acyclic graphs

Ludwig Nastansky, Stanley M. Selkow, Neil F. Stewart, 1974, Z. Oper. Research.

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

Gábor N. Sárközy, Stanley M. Selkow, S. Selkow, 2006, J. Graph Theory.

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

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

An application of the regularity lemma in generalized Ramsey theory

Gábor N. Sárközy, Stanley M. Selkow, S. Selkow, 2003, J. Graph Theory.

Inequalities for the first‐fit chromatic number

Zoltán Füredi, Gábor N. Sárközy, Stanley M. Selkow, 2008, J. Graph Theory.

Counting irregular multigraphs

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

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

Stanley M. Selkow, O. J. Murphy, 1986, Inf. Process. Lett..

Random Graph Isomorphism

Paul Erdös, László Babai, Stanley M. Selkow, 1980, SIAM J. Comput..

The Tree-to-Tree Editing Problem

Stanley M. Selkow, S. Selkow, 1977, Inf. Process. Lett..

Ramsey‐type results for Gallai colorings

Gábor N. Sárközy, Stanley M. Selkow, András Sebö, 2010, J. Graph Theory.

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

Gábor N. Sárközy, Stanley M. Selkow, S. Selkow, 2000, Electron. J. Comb..

An Extension Of The Ruzsa-Szemerédi Theorem

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

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

Gábor N. Sárközy, Stanley M. Selkow, Fei Song, 2013, J. Graph Theory.

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

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

Diagnostic Keys as a Representation for Context in Pattern Recognition

Stanley M. Selkow, 1974, IEEE Transactions on Computers.

Algorithms in a Nutshell

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

Vertex Partitions by Connected Monochromatic k-Regular Graphs

Gábor N. Sárközy, Stanley M. Selkow, 2000, J. Comb. Theory, Ser. B.

On the number of Hamiltonian cycles in Dirac graphs

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

New Bounds for the Clique Number of a Graph

Stanley M. Selkow, S. Selkow, 1978, Inf. Process. Lett..

On k-ordered Hamiltonian graphs

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

The Finite Power Property for Context-Free Languages

Charles E. Hughes, Stanley M. Selkow, 1981, Theor. Comput. Sci..

Algorithms in a nutshell - a desktop quick reference

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

A Probabilistic lower bound on the independence number of graphs

Stanley M. Selkow, 1994, Discret. Math..

The independence number of graphs in terms of degrees

Stanley M. Selkow, 1993, Discret. Math..

One-Pass Complexity of Digital Picture Properties

Stanley M. Selkow, 1972, JACM.

A characterization of n-component graphs

Stanley M. Selkow, Claude A. Christen, Giovanni Coray, 1996, Discret. Math..

BUILDING INTELLIGENT TUTORING SYSTEMS

Neil T. Heffernan, Stanley M. Selkow, Felix Geller, 2007 .

The complexity of the certification of properties of Stable Marriage

Daniel J. Dougherty, Stanley M. Selkow, 2004, Inf. Process. Lett..

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

Stanley M. Selkow, Steve Taylor, Nabil I. Hachem, 1997, Inf. Process. Lett..

On bipartite generalized Ramsey theory

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

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

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

Finding Nearest Neighbors with Voronoi Tessellations

Stanley M. Selkow, O. J. Murphy, 1990, Inf. Process. Lett..

On k-ordered Hamiltonian graphs

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

An application of the regularity lemma in generalized Ramsey theory

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

Ramsey-type results for Gallai colorings

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