Results 21 to 30 of about 11,127 (121)
Plant Biotechnology Journal, EarlyView.Schematic summary of the machine learning‐driven analysis for high‐yield cucumber architecture. This study employs machine learning methods to analyze key shoot and root traits, building a predictive model for yield. The analysis identifies an optimal plant architecture: a compact and sturdy shoot structure, combined with a narrow yet larger‐diameter ...
Cuifang Zhu +8 more
wiley +1 more source
Chromatic number and regular subgraphs
Bulletin of the London Mathematical Society, EarlyView.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
On Unicyclic Graphs with Minimum Graovac–Ghorbani Index
MathematicsIn discrete mathematics, graph theory is the study of graphs, which are mathematical structures used to model pairwise relations between objects.
Snježana Majstorović Ergotić
doaj +1 more source
New Zealand Journal of Agricultural Research, Volume 69, Issue 1, February 2026.The objective of this study was to evaluate body development, growth performance, ingestive behavior, and physiological responses of Nelore and crossbred calves during the cow‐calf phase. Thirty beef calves were divided into four groups according to their genotype: Nelore (NE; eight animals), Nelore × Senepol (NS; eight animals), Nelore × Montana (NM ...
Lidianny S. Amorim +9 more
wiley +1 more source
The Rise of Health Economics: Transforming the Landscape of Economic Research
Health Economics, Volume 35, Issue 1, Page 52-68, January 2026.ABSTRACT This paper explores the evolving role of health economics within economic research and publishing over the past 30 years. Historically, largely a niche field, health economics has become increasingly prominent, with the share of health economics papers in top journals growing significantly.
Lorenz Gschwent +3 more
wiley +1 more source
An Approach to the Girth Problem in Cubic Graphs
Journal of Graph Theory, Volume 111, Issue 1, Page 17-26, January 2026.ABSTRACT We offer a new, gradual approach to the largest girth problem for cubic graphs. It is easily observed that the largest possible girth of all n‐vertex cubic graphs is attained by a 2‐connected graph G = ( V , E ). By Petersen's graph theorem, E is the disjoint union of a 2‐factor and a perfect matching M.
Aya Bernstine, Nati Linial
wiley +1 more source
The 4-girth-thickness of the complete multipartite graph
, 2019 The $g$-girth-thickness $\theta(g,G)$ of a graph $G$ is the smallest number of planar subgraphs of girth at least $g$ whose union is $G$. In this paper, we calculate the $4$-girth-thickness $\theta(4,G)$ of the complete $m$-partite graph $G$ when each ...
Rubio-Montiel, Christian
core +1 more source
Behavioral Insights for Managing Environmental Decisions: An Experimental Test of Prospect Theory
Business Strategy and the Environment, Volume 34, Issue 8, Page 11024-11035, December 2025.ABSTRACT This research integrates a behavioral management perspective with experimental methods to examine how public workers in an environmental protection agency form beliefs. Study 1 uses conjoint experiments to assess employee perceptions of companies violating (1a) or adhering to (1b) environmental regulations.
Nicola Belle +2 more
wiley +1 more source
Face Sizes and the Connectivity of the Dual
Journal of Graph Theory, Volume 110, Issue 4, Page 379-391, December 2025.ABSTRACT For each c ≥ 1, we prove tight lower bounds on face sizes that must be present to allow 1‐ or 2‐cuts in simple duals of c‐connected maps. Using these bounds, we determine the smallest genus on which a c‐connected map can have a simple dual with a 2‐cut and give lower and some upper bounds for the smallest genus on which a c‐connected map can ...
Gunnar Brinkmann +2 more
wiley +1 more source
Strong Secrecy on the Binary Erasure Wiretap Channel Using Large-Girth LDPC Codes
, 2011 For an arbitrary degree distribution pair (DDP), we construct a sequence of low-density parity-check (LDPC) code ensembles with girth growing logarithmically in block-length using Ramanujan graphs.
Bloch, Matthieu +3 more
core +1 more source