Stanley M. Selkow

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

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of one.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2015
Coverings by Few Monochromatic Pieces: A Transition Between Two Ramsey Problems.
Graphs and Combinatorics, 2015

2013
An Improved Bound for Vertex Partitions by Connected Monochromatic K-Regular Graphs.
Journal of Graph Theory, 2013

2011
Vertex partitions of non-complete graphs into connected monochromatic k-regular graphs.
Discrete Mathematics, 2011

2010
Ramsey-type results for Gallai colorings.
Journal of Graph Theory, 2010

2009
Algorithms in a nutshell - a desktop quick reference.
O'Reilly, ISBN: 978-0-596-51624-6, 2009

2008
Inequalities for the first-fit chromatic number.
Journal of Graph Theory, 2008

Distributing vertices along a Hamiltonian cycle in Dirac graphs.
Discrete Mathematics, 2008

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

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

2004
The complexity of the certification of properties of Stable Marriage.
Inf. Process. Lett., 2004

An Extension Of The Ruzsa-Szemerédi Theorem.
Combinatorica, 2004

2003
An application of the regularity lemma in generalized Ramsey theory.
Journal of Graph Theory, 2003

On the number of Hamiltonian cycles in Dirac graphs.
Discrete Mathematics, 2003

On bipartite generalized Ramsey theory.
Ars Comb., 2003

2001
On Edge Colorings with at Least q Colors in Every Subset of p Vertices.
Electr. J. Comb., 2001

2000
Vertex Partitions by Connected Monochromatic k-Regular Graphs.
J. Comb. Theory, Ser. B, 2000

1999
On k-ordered Hamiltonian graphs.
Journal of Graph Theory, 1999

Counting irregular multigraphs.
Discrete Mathematics, 1999

1998
The enumeration of labeled graphs by number of cutpoints.
Discrete Mathematics, 1998

1997
The Average Height of a Node in the BANG Abstract Directory Tree.
Inf. Process. Lett., 1997

1996
A characterization of n-component graphs.
Discrete Mathematics, 1996

1994
A Probabilistic lower bound on the independence number of graphs.
Discrete Mathematics, 1994

1993
The independence number of graphs in terms of degrees.
Discrete Mathematics, 1993

1990
Finding Nearest Neighbors with Voronoi Tessellations.
Inf. Process. Lett., 1990

1986
The Efficiency of Using k-d Trees for Finding Nearest Neighbors in Discrete Space.
Inf. Process. Lett., 1986

1981
The Finite Power Property for Context-Free Languages.
Theor. Comput. Sci., 1981

1980
Random Graph Isomorphism.
SIAM J. Comput., 1980

1979
Some perfect coloring properties of graphs.
J. Comb. Theory, Ser. B, 1979

1978
New Bounds for the Clique Number of a Graph.
Inf. Process. Lett., 1978

1977
The Tree-to-Tree Editing Problem.
Inf. Process. Lett., 1977

1974
Diagnostic Keys as a Representation for Context in Pattern Recognition.
IEEE Trans. Computers, 1974

Cost-minimal trees in directed acyclic graphs.
Zeitschr. für OR, 1974

1972
One-Pass Complexity of Digital Picture Properties.
J. ACM, 1972


  Loading...