20883 research outputs found
Sort by
The personality of firefighters as a factor in receiving psychosocial support in high stress interventions
No full textThe discussion of selected literary works in Slovene language classes in the grammar school
No full text
Uloga predvidljivosti porođaja i upravljanja stresom i anksioznošću u zadovoljstvu porodom i postporođajnoj depresiji
No full textIn an online cross-sectional study of 371 Slovenian women, depressive symptoms were assessed using the Edinburgh Post- partum Depression Scale, and satisfaction with childbirth – in- cluding quality of care provision and stress and anxiety manage- ment – was measured with the Birth Satisfaction Scale. The prevalence of depression was 27.22% during pregnancy and 21.32% postpartum. Logistic regression identified significant predictors: stress and anxiety management of childbirth (sig- nificant in severe depression), a history of a depressive episode and depressive symptoms during pregnancy. More predictable deliveries were associated with higher satisfaction with childbirth. Results emphasize the importance of routine depression screening, support for stress and anxiety management, while predictable deliveries increase satisfaction with childbirth.U internetskoj presječnoj studiji na 371 Slovenki, depresivni simptomi procijenjeni su pomoću Edinburške ljestvice za postporođajnu depresiju, a zadovoljstvo porođajem – uključujući kvalitetu pružene skrbi te upravljanje stresom i anksioznošću – mjereno je ljestvicom zadovoljstva porođajem. Prevalencija depresije iznosila je 27,22 % tijekom trudnoće i 21,32 % nakon poroda. Logistička regresija identificirala je značajne prediktore: upravljanje stresom i anksioznošću pri porodu (značajno kod teške depresije), povijest depresivne epizode te depresivni simptomi tijekom trudnoće. Predvidljiviji porođaji povezani su s većim zadovoljstvom porođajem. Rezultati naglašavaju važnost rutinskog pregleda na depresiju, podrške u upravljanju stresom i anksioznošću, dok predvidljivi porođaji povećavaju zadovoljstvo porođajem
Popolnoma regularni mešani grafi, konstruirani iz CD(n, q) grafov Lazebnika, Ustimenka in Woldarja
No full textThe CD(n,q) graphs are connected components of q-regular graphs D(n,q) introduced in 1995 by Lazebnik and Ustimenko. They constitute the best universal family of regular graphs of prime power degree with regard to the Cage Problem which calls for determining the orders of the smallest k-regular graphs of girth g. The girths of the CD(n,q) graphs are known to be at least n+4 in case of even n, and n+5 for odd n. We propose to extend the use of the CD(n,q) graphs into the area of mixed graphs by adding directions to certain edges of the C(n,q)graphs.
In the context of mixed graphs, graphs in which the number of incident non-oriented edges is the same for all vertices, and the numbers of out-going and in-going edges are also equal and the same for all vertices, are of special interest and are called totally regular mixed graphs. In view of the special properties of the original C(n,q) graphs with regard to cages, we believe that the totally regular mixed graphs we propose to study may also prove to be extremal with regard to properties sought for in the area of mixed graphs
A unified Erdős–Pósa theorem for cycles in graphs labelled by multiple abelian groups
No full textIn 1965, Erdős and Pósa proved that there is an (approximate) duality between the maximum size of a packing of cycles and the minimum size of a vertex set hitting all cycles. Such a duality does not hold for odd cycles, and Dejter and Neumann-Lara asked in 1988 to find all pairs (l, z) of integers where such a duality holds for the family of cycles of length l modulo z. We characterise all such pairs, and we further generalise this characterisation to cycles in graphs labelled with a bounded number of abelian groups, whose values avoid a bounded number of elements of each group. This unifies almost all known types of cycles that admit such a duality, and it also provides new results. Moreover, we characterise the obstructions to such a duality in this setting, and thereby obtain an analogous characterisation for cycles in graphs embeddable on a fixed compact orientable surface
