Nonrepetitive colorings of lexicographic product of graphs [PDF]
, 2013 A coloring $c$ of the vertices of a graph $G$ is nonrepetitive if there exists no path $v_1v_2\ldots v_{2l}$ for which $c(v_i)=c(v_{l+i})$ for all $1\le i\le l$.
Keszegh, Balázs +2 more
core +3 more sources
Power of k Choices and Rainbow Spanning Trees in Random Graphs [PDF]
Electronic Journal of Combinatorics, 2014 We consider the Erd ő s-R e nyi random graph process, which is a stochastic process that starts with $n$ vertices and no edges, and at each step adds one new edge chosen uniformly at random from the set of missing edges. Let $\mathcal{G}(n,m)$ be a graph
Deepak Bal +3 more
semanticscholar +1 more source
Weak embeddings of posets to the Boolean lattice [PDF]
, 2018 The goal of this paper is to prove that several variants of deciding whether a poset can be (weakly) embedded into a small Boolean lattice, or to a few consecutive levels of a Boolean lattice, are NP-complete, answering a question of Griggs and of Patkos.
Pálvölgyi, Dömötör
core +3 more sources
Bounds on the 2-Rainbow Domination Number of Graphs [PDF]
Graphs Comb., 2010 A 2-rainbow domination function of a graph G is a function f that assigns to each vertex a set of colors chosen from the set {1, 2}, such that for any $${v\in V(G), f(v)=\emptyset}$$ implies $${\bigcup_{u\in N(v)}f(u)=\{1,2\}.}$$ The 2-rainbow domination
Yunjian Wu, N. J. Rad
semanticscholar +1 more source
Energetics of the Citric Acid Cycle in the Deep Biosphere
Geophysical Monograph Series, Page 303-327., 2020 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 amalgamation of some graphs with diameter 2
Journal of Physics: Conference Series, 2019 Let G = (V, E) be a nontrivial, connected, and edge-colored graph with n vertices, and let k be an integer with 2 ≤ k ≤ n. A tree T in G is a rainbow tree, if no two edges of T receive the same color.
Z. Awanis, A.N. M. Salman
semanticscholar +1 more source
PLoS Medicine, 2016 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
Geophysical Investigations at the Artemision at Amarynthos of Euboea (Greece)
Archaeological Prospection, EarlyView.ABSTRACT A combination of resistivity mapping and three‐dimensional electrical resistivity tomography (ERT) was used to investigate the subsurface of the sanctuary of Artemis Amarysia in Amarynthos, Euboea (Greece), an area where archaeological remains from the Bronze Age to the post‐Byzantine period are preserved.
G. N. Tsokas +5 more
wiley +1 more source
Graphs with 3-rainbow index $n-1$ and $n-2$ [PDF]
, 2013 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
The 3-rainbow index of a graph [PDF]
, 2013 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