7 A homogeneous set of a graph G is a set X of vertices such that 2 ≤ |X| < |V (G)| 8 and no vertex in V (G) − X has both a neighbor and a non-neighbor in X. A graph 9 is prime if it has no homogeneous set. We present an algorithm to decide whether a 10 class of graphs given by a finite set of forbidden induced subgraphs contains infinitely 11 many non-isomorphic prime graphs. 12

In this paper, we obtain a forbidden minor characterization of a cographic matroid M for which the splitting matroid Mx,y is graphic for every pair x, y of elements of M .

A semigroup is amiable if there is exactly one idempotent in each R⇤-class and in each L⇤-class. A semigroup is adequate if it is amiable and if its idempotents commute. We characterize adequate semigroups by showing that they are precisely those amiable semigroups which do not contain isomorphic copies of two particular nonadequate semigroups as subsemigroups.

This study aims to do a morphological and biochemical characterization of selected wild hop populations from the Banja Luka region, as plant material with potential value for introduction into selection. Female inflorescences (cones) seven (DKH3, DKH5, DKH6, DKH8, DKH9, DKH10, DKH11) were sampled in 2018 2019. Hop cones collected October 2019 characterization, when 50 per population analyzed, a...