Results 101 to 110 of about 115,444 (312)
DP-4-Colorability on Planar Graphs Excluding 7-Cycles Adjacent to 4- or 5-Cycles
MathematicsIn order to resolve Borodin’s Conjecture, DP-coloring was introduced in 2017 to extend the concept of list coloring. In previous works, it is proved that every planar graph without 7-cycles and butterflies is DP-4-colorable.
Fan Yang, Xiangwen Li, Ziwen Huang
doaj +1 more source
FEBS Open Bio, EarlyView.Tandem VHH targeting distinct EGFR epitopes were engineered into a monovalent bispecific antibody (7D12‐EGA1‐Fc) with more potent ADCC without increasing affinity to EGFR. Structural modeling of 7D12‐EGA1‐Fc showed cross‐linking of separate EGFR domains to enhance CD16a engagement on NK cells.
Yuqiang Xu +5 more
wiley +1 more source
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
List 3-Coloring on Comb-Convex and Caterpillar-Convex Bipartite Graphs
, 2023 Banu Baklan Şen +2 more
openalex +2 more sources
Nonrepetitive List Colorings of the Integers [PDF]
, 2021 Bartłomiej Bosek +3 more
openalex +1 more source
FEBS Open Bio, EarlyView.We investigated the toxicity of 12 active compounds commonly found in herbal weight loss supplements (WLS) using human liver and colon cell models. Epigallocatechin‐3‐gallate was the only compound showing significant toxicity. Metabolic profiling revealed protein degradation, disrupted energy and lipid metabolism suggesting that the inclusion of EGCG ...
Emily C. Davies +3 more
wiley +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
The List R-Hued Coloring of Km,N
, 2023 Meng Tang, Fengxia Liu, Hong‐Jian Lai
openalex +1 more source
FEBS Open Bio, EarlyView.CRISPRI‐mediated gene silencing and phenotypic exploration in nontuberculous mycobacteria. In this Research Protocol, we describe approaches to control, monitor, and quantitatively assess CRISPRI‐mediated gene silencing in M. smegmatis and M. abscessus model organisms.
Vanessa Point +7 more
wiley +1 more source