Results 21 to 30 of about 94,890 (115)
BackgroundInterleukin-2 (IL-2) has an essential role in the expansion and function of CD4+ regulatory T cells (Tregs). Tregs reduce tissue damage by limiting the immune response following infection and regulate autoreactive CD4+ effector T cells (Teffs ...
John A Todd +37 more
doaj +1 more source
On the threshold for rainbow connection number r in random graphs [PDF]
We call an edge colouring of a graph G a rainbow colouring if every pair of vertices is joined by a rainbow path, i.e., a path where no two edges have the same colour.
Heckel, Annika, Riordan, Oliver
core +1 more source
Extremal properties of flood-filling games [PDF]
The problem of determining the number of "flooding operations" required to make a given coloured graph monochromatic in the one-player combinatorial game Flood-It has been studied extensively from an algorithmic point of view, but basic questions about ...
Meeks, Kitty, Vu, Dominik K.
core +2 more sources
A Survey on Monochromatic Connections of Graphs [PDF]
The concept of monochromatic connection of graphs was introduced by Caro and Yuster in 2011. Recently, a lot of results have been published about it. In this survey, we attempt to bring together all the results that dealt with it.
Li, Xueliang, Wu, Di
core +3 more sources
In the present study was investigated anesthetic and histopathological effects of tea tree (Melaleuca alternifolia) and geranium (Pelargonium graveolens) essential oils in rainbow trout.
Hakan Didinen
doaj +1 more source
Energetics of the Citric Acid Cycle in the Deep Biosphere
This book is Open Access. A digital copy can be downloaded for free from Wiley Online Library.
Explores the behavior of carbon in minerals, melts, and fluids under extreme conditions
Carbon trapped in diamonds and carbonate-bearing rocks in subduction zones are examples of the continuing exchange of substantial carbon ...
Peter A. Canovas III, Everett L. Shock
wiley +1 more source
The 3-rainbow index of a graph [PDF]
Let $G$ be a nontrivial connected graph with an edge-coloring $c: E(G)\rightarrow \{1,2,...,q\},$ $q \in \mathbb{N}$, where adjacent edges may be colored the same. A tree $T$ in $G$ is a $rainbow tree$ if no two edges of $T$ receive the same color. For a
Chen, Lily +3 more
core
For two graphs S and T, the constrained Ramsey number f(S, T) is the minimum n such that every edge coloring of the complete graph on n vertices, with any number of colors, has a monochromatic subgraph isomorphic to S or a rainbow (all edges differently ...
Loh, Po-Shen, Sudakov, Benny
core +4 more sources
Cross‐Scale Hierarchical Targeted Delivery System Based on Small‐Scale Magnetic Robots
This article reviews a cross‐scale hierarchical targeted delivery system that integrates magnetic continuum robots and magnetic microrobots. By combining rapid long‐range navigation with precise microscale targeting, the system overcomes key limitations of single‐scale approaches.
Junjian Zhou +4 more
wiley +1 more source
Graphs with 3-rainbow index $n-1$ and $n-2$ [PDF]
Let $G$ be a nontrivial connected graph with an edge-coloring $c:E(G)\rightarrow \{1,2,\ldots,q\},$ $q\in \mathbb{N}$, where adjacent edges may be colored the same. A tree $T$ in $G$ is a $rainbow tree$ if no two edges of $T$ receive the same color.
Li, Xueliang, Yang, Kang, Zhao, Yan
core

