نتایج جستجو برای: wood painter

تعداد نتایج: 40662  

Journal: :The Annals of Iowa 1974

Journal: :Proceedings of the National Academy of Sciences of the United States of America 2005
G F Sprague

13 Darlington, C. D., Jour. Genetics, 24, 65-96 (1931). 14 Painter, T. S., Science, 73, 647-648 (1931). 16 Muller, H. J., and Painter, T. S., Z. I. A. V., 62, 316-365 (1932). 16 Dobzhansky, Th., Biol. Zbl., 52, 493-509 (1932). 17 Sivertzev-Dobzhansky, N. P., and Dobzhansky, Th., Genetics, 18, 173-192 (1933). 18 Metz, C. W., Zeit. Zellforsch., 4, 1-28 (1926). 19 Darlington, C. D., Genetics (in p...

Journal: : 2022

The modern-age coffin-reliquary of the Holy King Stefan Dečani was made at Monastery in 1849. It is believed to have been and wood-carved by woodworker Dimitar Stanišev Kruševo painted icon-painter Anastas Konstantinović. shaped like a four-legged sarcophagus, gilded ornately decorated with woodcarvings enveloping fields narrative scenes portraits Serbian saints. Among other images, lid feature...

Journal: :Journal of Cancer Research and Therapeutics 2011

Journal: :Transactions of the Japan Academy 1995

Journal: :Al-Raida Journal 1970

Journal: :Clinical and Experimental Optometry 2002

Journal: :Electr. J. Comb. 2014
Sárka Petrícková

An online Ramsey game (G,H) is a game between Builder and Painter, alternating in turns. During each turn, Builder draws an edge, and Painter colors it blue or red. Builder’s goal is to force Painter to create a monochromatic copy of G, while Painter’s goal is to prevent this. The only limitation for Builder is that after each of his moves, the resulting graph has to belong to the class of grap...

Journal: :Discrete Mathematics & Theoretical Computer Science 2008
Jaroslaw Grytczuk Hal A. Kierstead Pawel Pralat

We study on-line version of size-Ramsey numbers of graphs defined via a game played between Builder and Painter: in one round Builder joins two vertices by an edge and Painter paints it red or blue. The goal of Builder is to force Painter to create a monochromatic copy of a fixed graph H in as few rounds as possible. The minimum number of rounds (assuming both players play perfectly) is the on-...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید