The following pages link to Stanley M. Selkow (Q641169):
Displayed 35 items.
- (Q489350) (redirect page) (← links)
- Coverings by few monochromatic pieces: a transition between two Ramsey problems (Q489351) (← links)
- An extension of the Ruzsa-Szemerédi theorem (Q558315) (← links)
- Vertex partitions of non-complete graphs into connected monochromatic \(k\)-regular graphs (Q641170) (← links)
- The complexity of the certification of properties of stable marriage (Q834962) (← links)
- Finding nearest neighbors with Voronoi tessellations (Q910225) (← links)
- Distributing vertices along a Hamiltonian cycle in Dirac graphs (Q998458) (← links)
- (Q1092664) (redirect page) (← links)
- The efficiency of using k-d trees for finding nearest neighbors in discrete space (Q1092665) (← links)
- Some perfect coloring properties of graphs (Q1136777) (← links)
- The finite power property for context-free languages (Q1157912) (← links)
- The tree-to-tree editing problem (Q1251477) (← links)
- New bounds for the clique number of a graph (Q1254255) (← links)
- Counting irregular multigraphs (Q1296986) (← links)
- The independence number of graphs in terms of degrees (Q1313874) (← links)
- A probabilistic lower bound on the independence number of graphs (Q1336674) (← links)
- Vertex partitions by connected monochromatic \(k\)-regular graphs (Q1569063) (← links)
- The enumeration of labeled graphs by number of cutpoints (Q1584254) (← links)
- On edge colorings with at least \(q\) colors in every subset of \(p\) vertices (Q1594601) (← links)
- On the number of Hamiltonian cycles in Dirac graphs (Q1874364) (← links)
- A characterization of \(n\)-component graphs (Q1910584) (← links)
- The enumeration of minimal phylograms (Q2264631) (← links)
- On a Turán-type hypergraph problem of Brown, Erdős and T. Sós (Q2566157) (← links)
- Ramsey-type results for Gallai colorings (Q3055920) (← links)
- Inequalities for the first-fit chromatic number (Q3528161) (← links)
- (Q3900073) (← links)
- Random Graph Isomorphism (Q3901544) (← links)
- Onk-ordered Hamiltonian graphs (Q4265584) (← links)
- An application of the regularity lemma in generalized Ramsey theory (Q4434547) (← links)
- Diagnostic Keys as a Representation for Context in Pattern Recognition (Q4770515) (← links)
- An Improved Bound for Vertex Partitions by Connected Monochromatic K-Regular Graphs (Q4920655) (← links)
- Cost-minimal trees in directed acyclic graphs (Q5181099) (← links)
- (Q5466073) (← links)
- On an anti‐Ramsey problem of Burr, Erdős, Graham, and T. Sós (Q5471012) (← links)
- One-Pass Complexity of Digital Picture Properties (Q5661163) (← links)