Results 61 to 70 of about 213,457 (302)
Structure‐forward targeting of claudins with synthetic binders
FEBS 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
Finding and Counting Vertex-Colored Subtrees [PDF]
Algorithmica, 2010 Conference version in International Symposium on Mathematical Foundations of Computer Science (MFCS), Brno : Czech Republic (2010) Journal Version in ...
Guillemot, Sylvain, Sikora, Florian
openaire +4 more sources
Zhejiang 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
A Min-Max theorem about the Road Coloring Conjecture [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 The Road Coloring Conjecture is an old and classical conjecture e posed in Adler and Weiss (1970); Adler et al. (1977). Let $G$ be a strongly connected digraph with uniform out-degree $2$.
Rajneesh Hegde, Kamal Jain
doaj +1 more source
Peripheral lysosomes recruit PLEKHG3 to focal adhesions and restrain protrusion dynamics
FEBS 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
A Note on Coloring Vertex-Transitive Graphs [PDF]
The Electronic Journal of Combinatorics, 2015 We prove bounds on the chromatic number $\chi$ of a vertex-transitive graph in terms of its clique number $\omega$ and maximum degree $\Delta$. We conjecture that every vertex-transitive graph satisfies $\chi \le \max \{\omega, \left\lceil\frac{5\Delta + 3}{6}\right\rceil\}$, and we prove results supporting this conjecture.
Daniel W. Cranston, Landon Rabern
openaire +3 more sources
Cauchy: Jurnal Matematika Murni dan AplikasiThis article discusses a local antimagic coloring which is a combination between antimagic labeling and coloring. It is a new notion. We define a vertex weight of as where is the set of edges incident to .
R. Sunder +5 more
doaj +1 more source
CEACAM1 participation in breast cancer progression
Molecular Oncology, EarlyView.In invasive breast cancer (BC), CEACAM1 shifts from an apical to a uniform membranous/cytoplasmic pattern, or is lost, as tumors dedifferentiate, inversely tracking the Ki‐67 proliferative index. In MCF‐7 cells, only CEACAM1‐4L suppresses proliferation, repressing cell cycle and growth factor genes.
Mykola Lyndin +3 more
wiley +1 more source
Vertex rainbow colorings of graphs
Discussiones Mathematicae Graph Theory, 2012 In a properly vertex-colored graph G, a path P is a rainbow path if no two vertices of P have the same color, except possibly the two end-vertices of P. If every two vertices of G are connected by a rainbow path, then G is vertex rainbow-connected. A proper vertex coloring of a connected graph G that results in a vertex rainbow-connected graph is a ...
Futaba Fujie-Okamoto +3 more
openaire +1 more source
Game Chromatic Number of Tadpole Graph, Broom Graph, and Tribune Graph
JTAM (Jurnal Teori dan Aplikasi Matematika)Graph coloring game is one of application in graph theory. The goal in this article is determine game chromatic number of tadpole graph, broom graph, and tribune graph.
Fransiskus Fran, M Luthfi Abdurahman
doaj +1 more source