Results 21 to 30 of about 86,661 (105)
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
On the threshold for rainbow connection number r in random graphs [PDF]
, 2013 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
The $(k,\ell)$-rainbow index of random graphs [PDF]
, 2013 A tree in an edge colored graph is said to be a rainbow tree if no two edges on the tree share the same color. Given two positive integers $k$, $\ell$ with $k\geq 3$, the \emph{$(k,\ell)$-rainbow index} $rx_{k,\ell}(G)$ of $G$ is the minimum number of ...
Cai, Qingqiong +2 more
core
Note on the upper bound of the rainbow index of a graph [PDF]
, 2014 A path in an edge-colored graph $G$, where adjacent edges may be colored the same, is a rainbow path if every two edges of it receive distinct colors. The rainbow connection number of a connected graph $G$, denoted by $rc(G)$, is the minimum number of ...
Cai, Qingqiong, Li, Xueliang, Zhao, Yan
core
Diquarks: condensation without bound states
, 1999 We employ a bispinor gap equation to study superfluidity at nonzero chemical potential: mu .neq. 0, in two- and three-colour QCD. The two-colour theory, QC2D, is an excellent exemplar: the order of truncation of the quark-quark scattering kernel: K, has ...
A. Bender +30 more
core +1 more source
Reversion scheme for droplet parameters with rainbow refractometry based on Debye theory [PDF]
, 2011 This paper was presented at the 3rd Micro and Nano Flows Conference (MNF2011), which was held at the Makedonia Palace Hotel, Thessaloniki in Greece.
3rd Micro and Nano Flows Conference (MNF2011) +4 more
core
Rainbow sets in the intersection of two matroids [PDF]
, 2015 Given sets $F_1, \ldots ,F_n$, a {\em partial rainbow function} is a partial choice function of the sets $F_i$. A {\em partial rainbow set} is the range of a partial rainbow function.
Aharoni, Ron, Kotlar, Daniel, Ziv, Ran
core
Plasmonic Rainbow Trapping Structures for Light Localization and Spectrum Splitting [PDF]
, 2011 “Rainbow trapping” has been proposed as a scheme for localized storage of broadband electromagnetic radiation in metamaterials and plasmonic heterostructures.
Atwater, Harry, Jang, Min Seok
core +1 more source
Beyond the Borsuk-Ulam theorem: The topological Tverberg story
, 2017 B\'ar\'any's "topological Tverberg conjecture" from 1976 states that any continuous map of an $N$-simplex $\Delta_N$ to $\mathbb{R}^d$, for $N\ge(d+1)(r-1)$, maps points from $r$ disjoint faces in $\Delta_N$ to the same point in $\mathbb{R}^d$. The proof
Blagojević, Pavle V. M. +1 more
core +1 more source