Results 21 to 30 of about 13,653 (313)
The strong 3-rainbow index of some certain graphs and its amalgamation [PDF]
Opuscula Mathematica, 2022 We introduce a strong \(k\)-rainbow index of graphs as modification of well-known \(k\)-rainbow index of graphs. A tree in an edge-colored connected graph \(G\), where adjacent edge may be colored the same, is a rainbow tree if all of its edges have ...
Zata Yumni Awanis, A.N.M. Salman
doaj +1 more source
Facial rainbow edge-coloring of simple 3-connected plane graphs [PDF]
Opuscula Mathematica, 2020 A facial rainbow edge-coloring of a plane graph \(G\) is an edge-coloring such that any two edges receive distinct colors if they lie on a common facial path of \(G\).
Július Czap
doaj +1 more source
Metamagnetics with rainbow colors
Optics Express, 2007 A family of coupled nanostrips with varying dimensions is demonstrated exhibiting optical magnetic responses across the whole visible spectrum, from red to blue. We refer to such a phenomenon as rainbow magnetism. The experimental and analytical studies of such structures provide us with a universal building block and a general recipe for producing ...
Cai, Wenshan +6 more
openaire +4 more sources
Rainbow Ramsey problems for the Boolean lattice [PDF]
, 2020 We address the following rainbow Ramsey problem: For posets $P,Q$ what is the smallest number $n$ such that any coloring of the elements of the Boolean lattice $B_n$ either admits a monochromatic copy of $P$ or a rainbow copy of $Q$.
Chang, Fei-Huang +6 more
core +2 more sources
Rainbow Coloring Hardness via Low Sensitivity Polymorphisms [PDF]
, 2019 A k-uniform hypergraph is said to be r-rainbow colorable if there is an r-coloring of its vertices such that every hyperedge intersects all r color classes.
Guruswami, Venkatesan, Sandeep, Sai
core +1 more source
More Colors in a Rainbow [PDF]
Archives of Sexual Behavior, 2015 With her sexual configurations theory (SCT), van Anders (2015) wants to solve a number of problems with the current conceptualization of sexual orientation as defined by the sex of the partner(s) one is attracted to and habitually indicated with the Kinsey score varying from completely heterosexual to completely homosexual.
openaire +4 more sources
High Girth Hypergraphs with Unavoidable Monochromatic or Rainbow Edges
Discussiones Mathematicae Graph Theory, 2022 A classical result of Erdős and Hajnal claims that for any integers k, r, g ≥ 2 there is an r-uniform hypergraph of girth at least g with chromatic number at least k.
Axenovich Maria, Karrer Annette
doaj +1 more source
Rainbow connection number of amalgamation of some graphs
AKCE International Journal of Graphs and Combinatorics, 2016 Let G be a nontrivial connected graph. For k∈N, we define a coloring c:E(G)→{1,2,…,k} of the edges of G such that adjacent edges can be colored the same. A path P in G is a rainbow path if no two edges of P are colored the same. A rainbow path connecting
D. Fitriani, A.N.M. Salman
doaj +1 more source
Rainbow edge-coloring and rainbow domination
Discrete Mathematics, 2013 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
LeSaulnier, Timothy D., West, Douglas B.
openaire +1 more source
Rainbow Connectivity Using a Rank Genetic Algorithm: Moore Cages with Girth Six
Journal of Applied Mathematics, 2019 A rainbow t-coloring of a t-connected graph G is an edge coloring such that for any two distinct vertices u and v of G there are at least t internally vertex-disjoint rainbow (u,v)-paths.
J. Cervantes-Ojeda +3 more
doaj +1 more source