Results 161 to 170 of about 2,636 (206)
Art beyond cognition: reframing Neanderthal art through social connectivity and cultural transmission. [PDF]
Straffon L, Tennie C.
europepmc +1 more source
ABSTRACT Crop modelling is essential for agricultural water management but often relies on simplified water balance routines that limit representation of soil moisture dynamics. To address this limitation, we developed a coupled model that integrates the 1‐D Richards equation, solved using a finite difference method into the FAO AquaCrop.
Krishna Panthi +2 more
wiley +1 more source
Electroactive Poly(amic acid) Films Grafted with Pendant Aniline Tetramer for Hydrogen Sulfide Gas Sensing Applications. [PDF]
Luo KH, Chen YT, Wu HY, Ni ZK, Yeh JM.
europepmc +1 more source
Electronic structure and orbital interactions of intermediates throughout electrochemically catalyzed CO2‐to‐CO reduction reaction by iron porphyrin are carefully discussed by DFT calculations in this work. The results demonstrate distinct functions of Fe 3d orbitals and porphyrin π* orbitals for electron transfer process to CO2, and the electronic ...
Ching‐Chin Chen
wiley +1 more source
Identity and mobility through personal ornaments in Upper Paleolithic cantabrian hunter-gatherer societies: Insights from Llonín cave (Asturias, Spain). [PDF]
Pérez-García de Los Salmones D +5 more
europepmc +1 more source
On Odd Covers of Cliques and Disjoint Unions
ABSTRACT Babai and Frankl posed the “odd cover problem” of finding the minimum cardinality of a collection of complete bipartite graphs such that every edge of the complete graph of order n $n$ is covered an odd number of times. In a previous paper with O'Neill, some of the authors proved that this value is always ⌈ n / 2 ⌉ $\lceil n/2\rceil $ or ⌈ n /
Calum Buchanan +7 more
wiley +1 more source
Thermoresponsive Star Dendronized Polymers as Smart Nanoboxes. [PDF]
Qiao Z, Yao Y, Zhang A, Li W.
europepmc +1 more source
Flexible List Coloring of Graphs With Maximum Average Degree Less Than 3
ABSTRACT In the flexible list coloring problem, we consider a graph G $G$ and a color list assignment L $L$ on G $G$, as well as a subset U ⊆ V ( G ) $U\subseteq V(G)$ for which each u ∈ U $u\in U$ has a preferred color p ( u ) ∈ L ( u ) $p(u)\in L(u)$. Our goal is to find a proper L $L$‐coloring ϕ $\phi $ of G $G$ such that ϕ ( u ) = p ( u ) $\phi (u)=
Richard Bi, Peter Bradshaw
wiley +1 more source
Redox-Active Verdazyl Radical Polymers via Postpolymerization Modification of Active Ester Polymers. [PDF]
Ellingsen TA +7 more
europepmc +1 more source
On Sparsity Conditions Guaranteeing a Fractional Coloring
ABSTRACT A graph has an ( a : b ) $(a:b)$ ‐coloring if there exists an assignment from the vertices to subsets of { 1 , … , a } $\{1,\ldots ,a\}$ with size b $b$ such that adjacent vertices are assigned disjoint subsets. Odd girth at least 2 k + 1 $2k+1$ is a necessary condition for a graph to have a ( 2 k + 1 : k ) $(2k+1:k)$‐coloring.
Ilkyoo Choi
wiley +1 more source

