Results 31 to 40 of about 2,084 (327)
Rainbow connection number of Cm o Pn and Cm o Cn
Indonesian Journal of Combinatorics, 2020 Let G = (V(G),E(G)) be a nontrivial connected graph. A rainbow path is a path which is each edge colored with different color. A rainbow coloring is a coloring which any two vertices should be joined by at least one rainbow path.
Alfi Maulani +3 more
doaj +1 more source
Improved Inapproximability of Rainbow Coloring [PDF]
, 2020 A rainbow $q$-coloring of a $k$-uniform hypergraph is a $q$-coloring of the vertex set such that every hyperedge contains all $q$ colors. We prove that given a rainbow $(k - 2\lfloor \sqrt{k}\rfloor)$-colorable $k$-uniform hypergraph, it is NP-hard to find a normal $2$-coloring.
Per Austrin +2 more
openaire +2 more sources
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
Local strong rainbow connection number of corona product between cycle graphs
Indonesian Journal of Combinatorics, 2023 A rainbow geodesic is a shortest path between two vertices where all edges are colored differently. An edge coloring in which any pair of vertices with distance up to d, where d is a positive integer that can be connected by a rainbow geodesic is called ...
Khairunnisa N. Afifah, Kiki A. Sugeng
doaj +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
Algorithms for the Rainbow Vertex Coloring Problem on Graph Classes [PDF]
, 2020 Given a vertex-colored graph, we say a path is a rainbow vertex path if all its internal vertices have distinct colors. The graph is rainbow vertex-connected if there is a rainbow vertex path between every pair of its vertices.
Lima, Paloma T. +4 more
core +2 more sources
Fine-Grained Complexity of Rainbow Coloring and its Variants [PDF]
, 2017 Consider a graph G and an edge-coloring c_R:E(G) \rightarrow [k]. A rainbow path between u,v \in V(G) is a path P from u to v such that for all e,e' \in E(P), where e \neq e' we have c_R(e) \neq c_R(e').
Agrawal, Akanksha
core +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
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 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.
Sandeep, Sai, Guruswami, Venkatesan
core +1 more source