Results 61 to 70 of about 6,626,501 (294)

Cartesian积与邻点可区别着色之间的关系(Relation between Cartesian product and adjacent vertex distinguishing coloring)

open access: yesZhejiang Daxue xuebao. Lixue ban, 2017
A proper k-edge coloring of a graph G is an assignment of k colors 1, 2, …, k to edges of G such that any two adjacent edges receive the different colors.
WANGGuoxing(王国兴)
doaj   +1 more source

Structure‐forward targeting of claudins with synthetic binders

open access: yesFEBS Letters, EarlyView.
Claudins form the paracellular barriers between epithelial and endothelial tissues at tight junctions and are targets for molecular binders with the goal of modulating barrier permeability. Claudin‐binding molecules are relevant in drug delivery or in altering claudin interactions with disease‐causing proteins.
Alex J. Vecchio
wiley   +1 more source

Coloring count cones of planar graphs [PDF]

open access: yes, 2019
For a plane near-triangulation G with the outer face bounded by a cycle C, let n⋆G denote the function that to each 4-coloring ψ of C assigns the number of ways ψ extends to a 4-coloring of G.
Lidicky, Bernard, Dvorak, Zdenek
core  

Discerning protein pools by selective staining with self‐labeling tags

open access: yesFEBS Letters, EarlyView.
Cell surface proteins have an intra‐ and extracellular pool. Combining genetic fusion to self‐labeling tags that can be addressed with small molecule fluorophores allows separating these pools. We highlight recent developments and techniques for state‐of‐the‐art interrogation of cell surface proteins in the complex tissue setting.
Kati Fischermanns, Johannes Broichhagen
wiley   +1 more source

Erdős-Gallai-Type Results for Total Monochromatic Connection of Graphs

open access: yesDiscussiones Mathematicae Graph Theory, 2019
A graph is said to be total-colored if all the edges and the vertices of the graph are colored. A total-coloring of a graph is a total monochromatically-connecting coloring (TMC-coloring, for short) if any two vertices of the graph are connected by a ...
Jiang Hui, Li Xueliang, Zhang Yingying
doaj   +1 more source

Peripheral lysosomes recruit PLEKHG3 to focal adhesions and restrain protrusion dynamics

open access: yesFEBS Letters, EarlyView.
Proximity‐dependent labeling at the LAMTOR complex revealed the Rho GEF PLEKHG3 as a lysosome‐proximal protein directing the study toward the influence of lysosome positioning on actin dynamics and cell motility. We show that PLEKHG3 colocalizes with lysosomes at focal adhesion sites and observe that forced peripheral dispersion of lysosomes hinders ...
Rainer Ettelt   +8 more
wiley   +1 more source

Vertex-Distinguishing IE-Total Colorings of Complete Bipartite Graphs Km,N(m < n)

open access: yesDiscussiones Mathematicae Graph Theory, 2013
Let G be a simple graph. An IE-total coloring f of G is a coloring of the vertices and edges of G so that no two adjacent vertices receive the same color. Let C(u) be the set of colors of vertex u and edges incident to u under f. For an IE-total coloring
Chen Xiang’en, Gao Yuping, Yao Bing
doaj   +1 more source

An Improved Upper Bound on Neighbor Expanded Sum Distinguishing Index

open access: yesDiscussiones Mathematicae Graph Theory, 2020
A total k-weighting f of a graph G is an assignment of integers from the set {1, . . . , k} to the vertices and edges of G. We say that f is neighbor expanded sum distinguishing, or NESD for short, if Σw∈N(v) (f(vw) + f(w)) differs from Σw∈N(u)(f(uw) + f(
Vučković Bojan
doaj   +1 more source

Ligand‐dependent transcriptional heterogeneity in cell cycle gene expression delays G1/S entry

open access: yesFEBS Letters, EarlyView.
EGF and HRG induce distinct G1/S progression programs in ErbB2‐amplified BT474 breast cancer cells. Despite activating the potent ErbB2–ErbB3 heterodimer, HRG does not accelerate cell‐cycle entry. Instead, EGF promotes earlier restriction‐point passage via ERK–FOS signaling, whereas HRG activates the AKT–MYC axis, driving transcriptional heterogeneity ...
Ririn Rahmala Febri   +5 more
wiley   +1 more source

On harmonious chromatic number of triple star graph [PDF]

open access: yesJournal of Hyperstructures, 2016
A Harmonious coloring of a graph G is a proper vertex coloring of G, in which every pair of colors appears on at most one pair of adjacent vertices and the harmonious chromatic number of graph G is the minimum number of colors needed for the harmonious ...
Akhlak Mansuri
doaj   +1 more source

Home - About - Disclaimer - Privacy