Results 111 to 120 of about 76,042 (299)
A Short Proof for a Lower Bound on the Zero Forcing Number
We provide a short proof of a conjecture of Davila and Kenter concerning a lower bound on the zero forcing number Z(G) of a graph G. More specifically, we show that Z(G) ≥ (g − 2)(δ − 2) + 2 for every graph G of girth g at least 3 and minimum degree δ at
Fürst Maximilian, Rautenbach Dieter
doaj +1 more source
Sap flow and reversible stem shrinkage upon water depletion are strongly correlated under extreme drought conditions, but they respond differently to drought and cannot be used interchangeably when assessing tree response to drought. Abstract Temperate mixed forests are currently experiencing severe drought conditions and face increased risk of ...
L. S. Donfack +6 more
wiley +1 more source
GIRTH MEASUREMENTS OF BODY IN MEN OF DIFFERENT SOMATOTYPES [PDF]
К. Ш. Сакибаев
openalex +1 more source
Positive mixture effects in pine–oak forests during drought are context‐dependent
Mixture effects in drought‐stressed pine‐oak forests are context‐dependent, with Gambel oak and ponderosa pine benefiting from their complementarity under semi‐arid conditions. Abstract The increasing severity and frequency of droughts will play a pivotal role in shaping future forest ecosystems worldwide.
G. Schmied +8 more
wiley +1 more source
ABSTRACT A central aim of contracting is to introduce competition into public service delivery. Public organizations are facing calls to generate more competition for their contracts, yet there is conflicting evidence about the effects of competition in practice. This research aims to explain some of those mixed findings by investigating the effects of
Alice Moore
wiley +1 more source
this paper has been withdrawn because it has been ...
Bekkai, Siham, Kouider, Mekkia
openaire +2 more sources
Chromatic number and regular subgraphs
Abstract In 1992, Erdős and Hajnal posed the following natural problem: Does there exist, for every r∈N$r\in \mathbb {N}$, an integer F(r)$F(r)$ such that every graph with chromatic number at least F(r)$F(r)$ contains r$r$ edge‐disjoint cycles on the same vertex set? We solve this problem in a strong form, by showing that there exist n$n$‐vertex graphs
Barnabás Janzer +2 more
wiley +1 more source
Sei \(\Gamma_a\) die Klasse der endlichen zusammenhängenden Graphen vom Minimalgrad mindestens \(a\), und sei \(\Gamma_{a,k}\) die Klasse der \(G \in \Gamma_a\) mit der Taillenweite mindestens \(k\). Satz 1: Für \(q \geq q_n\) ist jedes \(G \in \Gamma_{3,q}\) auf \(K_n\) kontrahierbar. Der Verf. führt den Begriff \(k\)-zyklisch-eckenzusammenhängend ein.
openaire +1 more source
Abstract Blood flow restriction (BFR) has been identified as a potential countermeasure to mitigate physiological deconditioning during spaceflight. Guidelines recommend that tourniquet pressure be prescribed relative to limb occlusion pressure (LOP); however, it is unclear whether body tilting or reduced gravity analogues influence LOP.
Patrick Swain, Nick Caplan, Luke Hughes
wiley +1 more source

