Results 121 to 130 of about 14,237 (338)

Study of Architectural Ceramics of the Qal'a of Bani Hammad

Journal of Building Materials and Structures, 2018
In order to define with precision, the physicochemical characteristics of the architectural ceramic exhumed from the Qal'a of Bani Hammad’s site (inscribed on the UNESCO’s World Heritage List in 1980), our study was conducted on a set of ceramics.
Abla Brahimi, Messaoud Hamiane
doaj   +1 more source

Sum List Coloring 2 n Arrays

, 2007
A graph is f-choosable if for every collection of lists with list sizes speci ed by f there is a proper coloring using colors from the lists. The sum choice number is the minimum over all choosable functions f of the sum of the sizes in f .
Garth Isaak Department, Garth Isaak
core  

List colouring with a bounded palette

J. Graph Theory, 2015
Král' and Sgall (2005) introduced a refinement of list colouring where every colour list must be subset to one predetermined palette of colours. We call this $(k,\ell)$-choosability when the palette is of size at most $\ell$ and the lists must be of size at least $k$.
Bonamy, M., Kang, J.R.
openaire   +3 more sources

Pharmacological inhibition of the PERK pathway modulates hepatocellular carcinoma growth and immune signaling

FEBS Open Bio, EarlyView.
Pharmacological inhibition of PERK in a DEN‐induced mouse model of liver cancer does not reduce tumor burden but alters cellular stress signaling. Despite blocking PERK activity, downstream stress responses, including CHOP expression, remain active, suggesting compensatory mechanisms within the unfolded protein response that may influence tumor ...
Ada Lerma‐Clavero, Maria Kopsida, Nathalie Arendt, Hans Lennernäs, Markus Sjöblom, Femke Heindryckx   +5 more
wiley   +1 more source

List colorings with distinct list sizes, the case of complete bipartite graphs [PDF]

, 2011
Zoltán Füredi, Ida Kantor
openalex   +1 more source

Choice Numbers of Chordal, Chordless, and Some Non-Chordal Graphs

Mathematics
We prove that chordal graphs are chromatic-choosable and present a decomposition theorem to help estimate the choice numbers for certain classes of chordless and non-chordal graphs.
Julian Allagan, Jianning Su, Weizheng Gao, Shanzhen Gao   +3 more
doaj   +1 more source

On (k,kn-k2-2k-1)-Choosability of n-Vertex Graphs

International Journal of Mathematics and Mathematical Sciences, 2015
A (k,t)-list assignment L of a graph G is a mapping which assigns a set of size k to each vertex v of G and |⋃v∈V(G)‍L(v)|=t. A graph G is (k,t)-choosable if G has a proper coloring f such that f(v)∈L(v) for each (k,t)-list assignment L.
Wongsakorn Charoenpanitseri
doaj   +1 more source

Lipopolysaccharide uptake is augmented in lipopolysaccharide‐tolerant mouse macrophage‐like cells via increased CD14 expression

FEBS Open Bio, EarlyView.
In normal (nontolerant) cells, CD14 is crucial for both LPS uptake and LPS signaling. In LPS‐tolerant cells, in which LPS‐induced TNF‐α and IFN‐β production is suppressed, there is a dramatic increase in surface CD14 expression. The overexpressed CD14 in LPS‐tolerant cells is responsible for the enhanced LPS uptake without inducing pro‐inflammatory ...
Saeka Nishihara, Takayuki Manabe, Mika Jouta, Kiyoshi Kawasaki   +3 more
wiley   +1 more source

List Colorings of K₅‐Minor‐Free Graphs With Special List Assignments [PDF]

, 2011
Daniel W. Cranston, Anja Pruchnewski, Źsolt Tuza, Margit Voigt   +3 more
openalex   +1 more source

Sharp Choice Number Thresholds for Complete Bipartite Graphs

Axioms
Fix m≥3. The choice number ch(Km,n) of the complete bipartite graph Km,n has two sharp thresholds as n grows. We give complete proofs of the Hoffman–Johnson values at levels m+1 and m, and we pin down the extremal list assignments at the lower threshold ...
Julian Allagan, Benkam Bobga, Jianning Su, Weizheng Gao, Shanzhen Gao   +4 more
doaj   +1 more source