Results 221 to 230 of about 44,777 (248)
Some of the next articles are maybe not open access.
Journal of Small Fruit & Viticulture, 1996
ABSTRACT Natural infestations of blueberry gall midge (Dasineu-ra oxycoccana Johnson) on blueberries were studied in Florida and southeastern Georgia for three flowering seasons (1992-1994). If high populations of adult midges were present when the flower buds were beginning to expand, many rabbiteye cultivars suffered 50% to 100% crop loss.
Paul M. Lyrene, Jerry A. Payne
openaire +1 more source
ABSTRACT Natural infestations of blueberry gall midge (Dasineu-ra oxycoccana Johnson) on blueberries were studied in Florida and southeastern Georgia for three flowering seasons (1992-1994). If high populations of adult midges were present when the flower buds were beginning to expand, many rabbiteye cultivars suffered 50% to 100% crop loss.
Paul M. Lyrene, Jerry A. Payne
openaire +1 more source
Psychological Reports, 1980
Too-inclusive and too-rigid classifications of childhood emotional disorders have led diagnosticians to overlook conditions which do not fit under accepted labels. Recently this author has encountered a hitherto unnamed disorder which he calls the Blueberry syndrome, and which shares some features with autism, childhood psychosis and mental ...
openaire +2 more sources
Too-inclusive and too-rigid classifications of childhood emotional disorders have led diagnosticians to overlook conditions which do not fit under accepted labels. Recently this author has encountered a hitherto unnamed disorder which he calls the Blueberry syndrome, and which shares some features with autism, childhood psychosis and mental ...
openaire +2 more sources
Combinatorica, 1999
The author proves a rather innocent looking conjecture of P. Erdős and A. Hajnal. Namely, for every integer \(k\) there is a number \(f(k)\) such that if for a graph \(G\), every subgraph \(H\) of \(G\) has a stable set containing \((v(H)-k)/2\) vertices, then \(G\) contains a set \(X\) of at most \(f(k)\) vertices such that \(G \setminus X\) is ...
openaire +1 more source
The author proves a rather innocent looking conjecture of P. Erdős and A. Hajnal. Namely, for every integer \(k\) there is a number \(f(k)\) such that if for a graph \(G\), every subgraph \(H\) of \(G\) has a stable set containing \((v(H)-k)/2\) vertices, then \(G\) contains a set \(X\) of at most \(f(k)\) vertices such that \(G \setminus X\) is ...
openaire +1 more source
Frontiers: A Journal of Women Studies, 1993
André M. LaPalme, Andre M. LaPalme
openaire +1 more source
André M. LaPalme, Andre M. LaPalme
openaire +1 more source