Results 21 to 30 of about 1,445 (260)
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
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 +3 more sources
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 Path and Color Degree in Edge Colored Graphs [PDF]
The Electronic Journal of Combinatorics, 2014 Let $G$ be an edge colored graph. A rainbow pathin $G$ is a path in which all the edges are colored with distinct colors. Let $d^c(v)$ be the color degree of a vertex $v$ in $G$, i.e. the number of distinct colors present on the edges incident on the vertex $v$. Let $t$ be the maximum length of a rainbow path in $G$.
Anita Das 0001 +2 more
openaire +3 more sources
An updated survey on rainbow connections of graphs - a dynamic survey
Theory and Applications of Graphs, 2017 The concept of rainbow connection was introduced by Chartrand, Johns, McKeon and Zhang in 2008. Nowadays it has become a new and active subject in graph theory. There is a book on this topic by Li and Sun in 2012, and a survey paper by Li, Shi and Sun in
Xueliang Li, Yuefang Sun
doaj +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
Color code techniques in rainbow connection
Electronic Journal of Graph Theory and Applications, 2018 Let G be a graph with an edge k-coloring γ : E(G) → {1, …, k} (not necessarily proper). A path is called a rainbow path if all of its edges have different colors.
Fendy Septyanto, Kiki A. Sugeng
doaj +1 more source
BATAS ATAS RAINBOW CONNECTION NUMBER PADA GRAF BUCKMINSTERFULLERENE
Jurnal Matematika UNAND, 2022 Misalkan G adalah suatu graf terhubung tak trivial. Suatu pewarnaan c : E(G) → {1, 2, ..., k}, k ∈ N pada graf G adalah suatu pewarnaan sisi di G sedemikian sehingga setiap sisi bertetangga boleh berwarna sama.
Fitri - Anggalia +2 more
doaj +1 more source
Online Rainbow Coloring In Graphs
CoRR, 2019 9 pages, 1 figure, Appeared in Proceeding of International Conference on Discrete Mathematics and its Applications to Network Science(ICDMANS-2018)
Debasis Dwibedy +2 more
openaire +2 more sources