15.

We construct a Π2 enumeration degree which is a strong minimal cover.

It has been known for more than 40 years that there are posets with planar cover graphs and arbitrarily large dimension. Recently, Streib and Trotter proved that such posets must have large height. In fact, all known constructions of such posets have two large disjoint chains with all points in one chain incomparable with all points in the other. Gutowski and Krawczyk conjectured that this feat...

An old question of Yates as to whether all minimal degrees have a strong minimal cover remains one of the longstanding problems of degree theory, apparently largely impervious to present techniques. We survey existing results in this area, focussing especially on some recent progress.

The aim of this study was to assess the regional effects of fire on the surface cover and forage production of mountainous rangelands of Delfan County, Lorestan province, Iran. The fire took placed in June 2007 with significant effects on the vegetation characteristics in the study area. Four fire affected sites were selected for sampling and a close area without fire was considered as control....

because soil moisture condition affects vegetation changes hence, monitoring of drought and vegetation changes are among valuable management tools in these ecosystems. nowadays, satellite images are used as a low-cost and fast method for vegetation study in different scales. vegetation change is assessed using vegetation spectral characteristics. this study aimed to analyze and monitor the vege...

rangelands encompass 55% of iran's territory. monitoring of such resources is inevitable due to dynamic behavior and extremely high extension. scanning of land resources data by satellites facilitates monitoring the rangelands. this research was carried out to study the relationships of vegetation indices derived from irs liss-iii data with vegetation cover of tange sayyad region in the ch...

two different methods of bayesian segmentation algorithm were used with different band combinations. sequential maximum a posteriori (smap) is a bayesian image segmentation algorithm which unlike the traditional maximum likelihood (ml) classification attempts to improve accuracy by taking contextual information into account, rather than classifying pixels separately. landsat 7 etm+ data with pa...

An equivalence graph is a vertex disjoint union of complete graphs. For a graph G, let eq(G) be the irdnimum number of equivalence subgraphs of G needed to cover all edges of G. Similarly, let cc(G) be the minimum number of complete subgraphs of G needed to cover all its edges. Let H be a graph on n vertices with ma,'dmal degree _~d (and minimal degree --~ 1), and let G=I~ be its complement. We...

Introduction Conclusions References Tables Figures ◭ ◮ ◭ ◮ Back Close Full Screen / Esc Abstract Introduction Conclusions References