Zobrazeno 1 - 10
of 48
pro vyhledávání: '"Selkow, Stanley"'
The typical problem in (generalized) Ramsey theory is to find the order of the largest monochromatic member of a family F (for example matchings, paths, cycles, connected subgraphs) that must be present in any edge coloring of a complete graph K_n wi
Externí odkaz:
http://arxiv.org/abs/1304.0871
Autor:
Sarkozy, Gabor N., Selkow, Stanley
A Hamiltonian graph $G$ of order $n$ is $k$-ordered, $2\leq k \leq n$, if for every sequence $v_1, v_2, \ldots ,v_k$ of $k$ distinct vertices of $G$, there exists a Hamiltonian cycle that encounters $v_1, v_2, \ldots , v_k$ in this order. In this pap
Externí odkaz:
http://arxiv.org/abs/math/9612212
Publikováno v:
In Discrete Mathematics 2011 311(18):2079-2084
Autor:
Sárközy, Gábor N., Selkow, Stanley
Publikováno v:
In Discrete Mathematics 2008 308(23):5757-5770
Publikováno v:
In Discrete Mathematics 2003 265(1):237-250
Publikováno v:
Journal of Graph Theory. Jun2013, Vol. 73 Issue 2, p127-145. 19p.
Autor:
Sárközy, Gábor N., Selkow, Stanley M.
Publikováno v:
In Journal of Combinatorial Theory, Series B January 2000 78(1):115-122
Autor:
Selkow, Stanley M.
Publikováno v:
Journal of the ACM; Apr1972, Vol. 19 Issue 2, p283-295, 13p
Ca?a wiedza o algorytmach w jednym podr?czniku!Jaki wp?yw na ró?ne algorytmy wywieraj? podobne decyzje projektowe?Jak rozwi?zywa? proble